Optimal divisible job load sharing for bus networks

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. It is analytically proved, for the first time, that a minimal solution time is achieved when the computation by each processor finishes at the same time. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are also obtained.

[1]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[2]  Krithi Ramamritham,et al.  Preemptive Scheduling Under Time and Resource Constraints , 1987, IEEE Transactions on Computers.

[3]  Thomas G. Robertazzi,et al.  Bus-oriented load sharing for a network of sensor driven processors , 1991, IEEE Trans. Syst. Man Cybern..

[4]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[5]  Debasish Ghose,et al.  Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Thomas G. Robertazzi,et al.  Ultimate performance limits for networks of load sharing processors , 1992 .

[7]  Debasish Ghose,et al.  Multi-installment load distribution in tree networks with delays , 1995 .

[8]  Thomas G. Robertazzi,et al.  Distributed computation for a tree network with communication delays , 1990 .

[9]  Debasish Ghose,et al.  Distributed Computation with Communication Delays: Asymptotic Performance Analysis , 1994, J. Parallel Distributed Comput..

[10]  Thomas G. Robertazzi.  Processor equivalence for daisy chain load sharing processors , 1993 .

[11]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[12]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[13]  Hyoung Joong Kim,et al.  Optimal load distribution for tree network processors , 1996 .

[14]  Debasish Ghose,et al.  An efficient load distribution strategy for a distributed linear network of processors with communication delays , 1995 .

[15]  Debasish Ghose,et al.  Distributed computation in linear networks: closed-form solutions , 1994 .

[16]  Thomas G. Robertazzi,et al.  Optimal load sharing for a divisible job on a bus network , 1992 .

[17]  Thomas G. Robertazzi.  Processor equivalence for a linear daisy chain of load sharing processors , 1992 .

[18]  Thomas G. Robertazzi,et al.  Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job , 1993, ICPP.

[19]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[20]  Shahid H. Bokhari,et al.  Assignment Problems in Parallel and Distributed Computing , 1987 .