A state-aggregation method for analyzing dynamic load-balancing policies

Exact performance analyses of dynamic load-balancing policies for distributed systems are very difficult because the state space is multidimensional and load-balancing decisions are state-dependent. A state-aggregation method is proposed to analyze the performance of dynamic load-balancing policies. Those states with the same number of jobs are aggregated into a single state. The number of jobs in the system is modeled by a birth-death Markov process. The state transition rates are estimated by an iterative procedure. The proposed state-aggregation method is applied to analyze the performance of a particular dynamic load-balancing policy, namely a symmetric policy with threshold value equal to one. Extensive simulations were performed to study the accuracy of the state-aggregation method. This method provides accurate performance estimates for the symmetric policy for systems of various sizes when the mean job transfer delay is small compared to the average job service time.<<ETX>>

[1]  Robert M. Keller,et al.  The Gradient Model Load Balancing Method , 1987, IEEE Transactions on Software Engineering.

[2]  Tak-Shing Peter Yum,et al.  Adaptive Load Balancing For Parallel Queues , 1984, ICC.

[3]  Cauligi S. Raghavendra,et al.  An analysis of the join the shortest queue (JSQ) policy , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[4]  Jane W.-S. Liu,et al.  Dynamic Load Balancing Algorithms in Homogeneous Distributed Systems , 1986, IEEE International Conference on Distributed Computing Systems.

[5]  John A. Stankovic,et al.  Simulations of Three Adaptive, Decentralized Controlled, Job Scheduling Algorithms , 1984, Comput. Networks.

[6]  Donald F. Towsley,et al.  Analysis of the Effects of Delays on Load Sharing , 1989, IEEE Trans. Computers.

[7]  Anurag Kumar,et al.  Adaptive Optimal Load Balancing in a Nonhomogeneous Multiserver System with a Central Job Scheduler , 1990, IEEE Trans. Computers.

[8]  Miron Livny,et al.  Load Balancing in Homogeneous Broadcast Distributed Systems , 1982, SIGMETRICS.

[9]  Kemal Efe,et al.  Minimizing control overheads in adaptive load sharing , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[10]  Cauligi S. Raghavendra,et al.  Performance study of dynamic load balancing policies for distributed systems with service interruptions , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[11]  Jacob A. Abraham,et al.  Load Balancing in Distributed Systems , 1982, IEEE Transactions on Software Engineering.

[12]  Philip Heidelberger,et al.  A spectral method for confidence interval generation and run length control in simulations , 1981, CACM.

[13]  Edward D. Lazowska,et al.  A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.

[14]  Anurag Kumar,et al.  Adaptive optimal load balancing in a heterogeneous multiserver system with a central job scheduler , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[15]  Donald F. Towsley,et al.  Imbedding gradient estimators in load balancing algorithms , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[16]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[17]  Chong-Wei Xu,et al.  A Distributed Drafting Algorithm for Load Balancing , 1985, IEEE Transactions on Software Engineering.

[18]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[19]  Phillip Krueger,et al.  Two adaptive location policies for global scheduling algorithms , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[20]  Songnian Zhou.  A Trace-Driven Simulation Study of Dynamic Load Balancing , 1988, IEEE Trans. Software Eng..

[21]  Cauligi S. Raghavendra,et al.  Optimal joint load balancing and routing in message switched computer networks , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[22]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[23]  Asser N. Tantawi,et al.  A General Model for Optimal Static Load Balancing in Star Network Configurations , 1984, Performance.

[24]  Anders Svensson.  History, an intelligent load sharing filter , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[25]  Cauligi S. Raghavendra,et al.  A Dynamic Load-Balancing Policy With a Central Job Dispatcher (LBC) , 1992, IEEE Trans. Software Eng..

[26]  Mario Gerla,et al.  Load Balancing in Distributed Systems with Multiple Classes and Site Constraints , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.