A Negotiation Protocol for Dynamic Load Distribution Using Batch Task Assignments

Adynamic load distribution(LD) algorithm improves the performance of a distributed system by using current system load information to relocate application tasks among processing nodes, so that workload imbalance in the system can be smoothed out. In this paper, we propose aguarantee and reservation protocol(GR protocol) which can be used by dynamic LD algorithms. In contrast to the commonly usedsingle task assignments, GR protocol usesbatch task assignments, meaning that multiple tasks can be selected for remote execution during each single sender?receiver negotiation session. GR protocol is used to obtain a mutual agreement between a task sender and a receiver on an appropriate task batch size. GR protocol is based on avirtual workload modelwhich ensures coordinated even dispersements of tasks in the system. This model also avoidsprocessor thrashing, a situation when a receiver node is flooded with excessive remotely assigned tasks and thus becomes overloaded inadvertently.

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

[2]  Donald F. Towsley,et al.  Adaptive Load Sharing in Heterogeneous Distributed Systems , 1990, J. Parallel Distributed Comput..

[3]  James R. Lyle,et al.  Load balancing from a Unix shell , 1988, Proceedings [1988] 13th Conference on Local Computer Networks.

[4]  Marvin Theimer,et al.  Finding Idle Machines in a Workstation-Based Distributed System , 1989, IEEE Trans. Software Eng..

[5]  Arif Ghafoor,et al.  Performance prediction of distributed load balancing on multicomputer systems , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[6]  Yung-Terng Wang,et al.  Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.

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

[8]  Sau-Ming Lau,et al.  An adaptive algorithm for resolving processor thrashing in load distribution , 1995, Concurr. Pract. Exp..

[9]  Mukesh Singhal,et al.  A load index and a transfer policy for global scheduling tasks with deadlines , 1995, Concurr. Pract. Exp..

[10]  Chung-Kwong Yuen,et al.  Dynamic load balancing on a distributed system , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

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

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

[13]  Jeff Kramer,et al.  Methodical Analysis of Adaptive Load Sharing Algorithms , 1992, IEEE Trans. Parallel Distributed Syst..

[14]  Mukesh Singhal,et al.  Load distributing for locally distributed systems , 1992, Computer.

[15]  Sau-Ming Lau,et al.  An adaptive load balancing algorithm for heterogeneous distributed systems with multiple task classes , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[16]  Ware Myers.  Supercomputing 91 , 1992 .

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

[18]  Donald F. Towsley,et al.  Adaptive load sharing in heterogeneous systems , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.