OPTIMAL LOAD SHARING FOR A DIVISIBLE JOB AND MARKOV CHAIN MODELS ON A BUS NETWORK

摘要

In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. Such equivalence is demonstrated for divisible scheduling on a bus network. Optimal load allocation for load sharing a divisible job over N processors interconnected in bus-oriented network is considered. The processors are equipped with front-end processors, without front-end processors and with control processor. The minimal solution time is achieved when the computation by each processor finishes at the same time.