Distributed algorithms for load balancing in very large homogeneous systems

Authors:
S. H. Hosseini;B. E. Litow;M. I. Malkawi;K. Vairavan
Affiliations:
Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, P. O. Box 784, Milwaukee, Wisconsin;Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, P. O. Box 784, Milwaukee, Wisconsin;Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, P. O. Box 784, Milwaukee, Wisconsin;Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, P. O. Box 784, Milwaukee, Wisconsin
Venue:
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Year:
1987

Citing 10
Cited 1

A distributed load-balancing policy for a multicomputer

Software—Practice & Experience
A Distributed Drafting Algorithm for Load Balancing

IEEE Transactions on Software Engineering
Adaptive load sharing in homogeneous distributed systems

IEEE Transactions on Software Engineering
The Gradient Model Load Balancing Method

IEEE Transactions on Software Engineering - Special issue on distributed systems
A comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)

SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A load index for dynamic load balancing

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Output Guards and Nondeterminism in “Communicating Sequential Processes”

ACM Transactions on Programming Languages and Systems (TOPLAS)
New methods to color the vertices of a graph

Communications of the ACM
A large scale, homogeneous, fully distributed parallel machine, I

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Graphs and Hypergraphs

Graphs and Hypergraphs

Research: Effect of fault tolerance and communication delay on response time in a multiprocessor system with a bus topology

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to improve the performance of a system it is necessary to balance the loads among the processors in the system. We propose distributed load balancing algorithms for very large systems with possibly thousands of processors. The proposed algorithms are truly distributed, i.e., there does not exist any central controller to provide control, coordination, or mediation among the processors. Processors, with the use of local knowledge and interaction with their neighbors, maintain global balance in the system. The way processors are paired to exchange their loads will have an impact on the performance of the system. We have shown that an effective pairing of processors is possible with the use of the concepts of edge-coloring and node-coloring from graph theory. The proposed algorithms are truly dynamic and adaptable to instantaneous changes in the system. Their correct operation does not depend on any fixed-threshold level. They provide a fair service to every job regardless of its source of delivery to the system.