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.
Optimal divisible job load sharing for bus networks
IEEE Transactions on Aerospace and Electronic Systems ; 32 , 1 ; 34-40
1996-01-01
1260551 byte
Article (Journal)
Electronic Resource
English
Optimal Divisible Job Load Sharing for Bus Networks
Online Contents | 1996
|Optimal time-varying load sharing for divisible loads
IEEE | 1998
|Optimal Time-Varying Load Sharing for Divisible Loads
Online Contents | 1998
|Divisible Load Cut Through Switching in Sequential Tree Networks
Online Contents | 2004
|A Scheduling Algorithm with Divisible Load in Wireless Sensor Networks
British Library Online Contents | 2012
|