Load balancing in large networks: a comparative study
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 686-689
- https://doi.org/10.1109/spdp.1991.218196
Abstract
The authors compare six well known and two new load balancing strategies on torus and ring topologies of different sizes and workload characteristics. Through simulations on a large transputer network, they show that all strategies behave differently under the workload of process and data migration. The two new algorithms based on the gradient model method are shown to be robust to both kinds of workloads. Thus, these new algorithms are good candidates for distributed operating systems running on large networks, where the workload characteristics can not be determined in advance.Keywords
This publication has 5 references indexed in Scilit:
- Imbedding gradient estimators in load balancing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Microeconomic algorithms for load balancing in distributed computer systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Embedding one Interconnection Network in AnotherPublished by Springer Nature ,1990
- The Gradient Model Load Balancing MethodIEEE Transactions on Software Engineering, 1987
- Random Trees and the Analysis of Branch and Bound ProceduresJournal of the ACM, 1984