Modeling and Simulation of Dynamic Load Balancing Using Queueing Theory

The aim of this article is to present an original modeling of dynamic load balancing, using qucueing theory, then to present a simulation method, using QNAP software and finally to show that results of the model and results of the simulation are identical. First we present six load balancing strategies we simulate using the QNAP software, and we study the basic parameters: the load, the number of nodes, the communication speed, and the overload rate. Then we realise a complete and original modeling of the “optimal” strategy. The values given by this method are reference values for other strategies. By comparing the results, we demonstrate the accuracy of our mathematical model and the precision of our simulation.

[1]  Walter H. Kohler,et al.  Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[2]  David J. Evans,et al.  Dynamic Load Balancing Using Task-Transfer Probabilities , 1993, Parallel Comput..

[3]  Mario Gerla,et al.  Queueing Network Models for Load Balancing in Distributed Systems , 1991, J. Parallel Distributed Comput..

[4]  Fred Douglis,et al.  Process Migration in the Sprite Operating System , 1987, ICDCS.

[5]  J.-C. Ryou,et al.  A task migration algorithm for load balancing in a distributed system , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[6]  Laurent Philippe,et al.  A performance study of dynamic load balancing algorithms for multicomputers , 1994, Proceedings of the First International Conference on Massively Parallel Computing Systems (MPCS) The Challenges of General-Purpose and Special-Purpose Computing.

[7]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

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

[9]  Barton P. Miller,et al.  Process migration in DEMOS/MP , 1983, SOSP '83.

[10]  Krithi Ramamritham,et al.  Distributed Scheduling of Tasks with Deadlines and Resource Requirements , 1989, IEEE Trans. Computers.

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

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

[13]  Edward D. Lazowska,et al.  The limited performance benefits of migrating active processes for load sharing , 1988, SIGMETRICS 1988.

[14]  Alexander Thomasian.  A Performance Study of Dynamic Load Balancing in Distributed Systems , 1987, ICDCS.

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

[16]  John A. Stankovic,et al.  An Adaptive Bidding Algorithm For Processes, Clusters and Distributed Groups , 1984, ICDCS.

[17]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[18]  François Spies,et al.  A Cooperative Algorithm for Load Balancing in Interconnected Transputer Network , 1993, Decentralized and Distributed Systems.

[19]  John Zahorjan,et al.  Balanced job bound analysis of queueing networks , 1982, CACM.

[20]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[21]  Jonathan R. Agre,et al.  A queueing network approach to the module allocation problem in distributed systems , 1981, SIGMETRICS '81.

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