| A Distributed Drafting Algorithm for Load Balancing |
| Full text |
Publisher Site
|
| Source
|
IEEE Transactions on Software Engineering
archive
Volume 11 , Issue 10 (October 1985)
table of contents
Pages: 1153-1161
Year of Publication: 1985
ISSN:0098-5589
|
|
Authors
|
|
| Publisher |
IEEE Press
Piscataway, NJ, USA
|
| Bibliometrics |
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 27
|
|
|
ABSTRACT
It is desirable for the load in a distributed system to be balanced evenly. A dynamic process migration protocol is needed in order to achieve load balancing in a user transparent manner. A distributed algorthim for load balancing which is network topology independent is proposed in this paper. Different network topologies and low-level communications protocols affect the choice of only some system design parameters. The "drafting" algorithm attempts to compromise two contradictory goals: maximize the processor utilization and minimize the communication overhead. The main objective of this paper is to describe the dynamic process migration protocol based on the proposed drafting algorithm. A sample distributed system is used to further illustrate the drafting algorithm and to show how to define system design parameters. The system performance is measured by simulation experiments based on the sample system.
CITED BY 27
|
|
|
|
|
|
|
|
|
|
|
J. Barhen , S. Gulati , S. S. Iyengar, The pebble crurching model for load balancing in concurrent hypercube ensembles, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.189-199, January 19-20, 1988, Pasadena, California, United States
|
|
|
S. H. Hosseini , B. E. Litow , M. I. Malkawi , K. Vairavan, Distributed algorithms for load balancing in very large homogeneous systems, Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, p.397-404, December 1987, Dallas, Texas, United States
|
|
|
Bhaskar Ghosh , F. T. Leighton , Bruce M. Maggs , S. Muthukrishnan , C. Greg Plaxton , R. Rajaraman , Andréa W. Richa , Robert E. Tarjan , David Zuckerman, Tight analyses of two local load balancing algorithms, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.548-558, May 29-June 01, 1995, Las Vegas, Nevada, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ishfaq Ahmad , Arif Ghafoor , Kishan Mehrotra, Performance prediction of distributed load balancing on multicomputer systems, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, p.830-839, November 18-22, 1991, Albuquerque, New Mexico, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
REVIEW
"Ivan Patrizio Maffezzini : Reviewer"
This paper is about an algorithm for load balancing in a Local Area Network
(LAN) environment. The elements on the LAN are homogeneous and the protocol
for the process migration is dynamic and allows a process to migrate only
once. After critici
more...
|