This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Distributed Drafting Algorithm for Load Balancing
October 1985 (vol. 11 no. 10)
pp. 1153-1161
L.M. Ni, Department of Computer Science, Michigan State University
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.
Index Terms:
system performance, Bidding algorithm, computer network, distributed algorithm, distributed operation system, distributed system, load balancing, process migration
Citation:
L.M. Ni, null Chong-Wei Xu, T.B. Gendreau, "A Distributed Drafting Algorithm for Load Balancing," IEEE Transactions on Software Engineering, vol. 11, no. 10, pp. 1153-1161, Oct. 1985, doi:10.1109/TSE.1985.231863
Usage of this product signifies your acceptance of the Terms of Use.