This Article 
 Bibliographic References 
 Add to: 
An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems
March 1992 (vol. 41 no. 3)
pp. 381-384

The authors propose a load-balancing algorithm that determines the optimal load for each host so as to minimize the overall mean job response time in a distributed computer system that consists of heterogeneous hosts. The algorithm is a simplified and easily understandable version of the single-point algorithm originally presented by A.N. Tantawi and D. Towsley (1985).

[1] S. C. Dafermos and F. T. Sparrow, "The traffic assignment problem for a general network,"J. Res. Nat. Bureau of Standards--B. Mathematical Sci., vol. 73b, no. 2, pp. 91-118, Apr.-June 1969.
[2] L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method: An approach to store-and-forward communication network design,"Networks, vol. 3, pp. 97-133, 1973.
[3] T. L. Magnanti, "Models and algorithms for predicting urban traffic equilibria," inTransportation Planning Models, M. Florian, Ed. Elsevier Science (North-Holland), 1984, pp. 153-185.
[4] A. N. Tantawi and D. Towsley, "A general model for optimal static load balancing in star network configurations," inProc. Performance '84, pp. 277-291.
[5] A. N. Tantawi and D. Towsley, "Optimal static load balancing in distributed computer systems,"J. ACM, pp. 445-465, Apr. 1985.

Index Terms:
LAN; algorithm; optimal static load balancing; distributed computer systems; mean job response time; heterogeneous hosts; single-point algorithm; distributed processing; local area networks.
Chonggun Kim, H. Kameda, "An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems," IEEE Transactions on Computers, vol. 41, no. 3, pp. 381-384, March 1992, doi:10.1109/12.127455
Usage of this product signifies your acceptance of the Terms of Use.