A Distributed Drafting Algorithm for Load Balancing

  • Authors:
  • Lionel M. Ni;Chong-Wei Xu;Thomas B. Gendreau

  • Affiliations:
  • Michigan State Univ., East Lansing;Michigan State Univ., East Lansing;Michigan State Univ., East Lansing

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1985

Quantified Score

Hi-index 0.02

Visualization

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.