The effect of scheduling discipline on dynamic load sharing in heterogeneous distributed systems

Dynamic load sharing policies have been extensively studied. Most of the previous studies have assumed a homogeneous distributed system with a first-come/first-served (FCFS) node scheduling policy. In addition, job service times and inter-arrival times are assumed to be exponentially distributed. In this paper, we study the impact of these assumptions on the performance of sender-initiated and receiver-initiated dynamic load sharing policies in heterogeneous distributed systems. We consider two node scheduling policies-the FCFS and round-robin (RR) policies. Furthermore, the impact of variance in inter-arrival times and job service times is studied. Our results show that, even in heterogeneous distributed systems, when the RR policy is used, sender-initiated policy is better than the receiver-initiated policy unless the variance in job service times is low. This is an important observation, as most workstations use a scheduling policy that is similar to the RR policy considered in this paper.

[1]  Jingwen Wang,et al.  Utopia: A load sharing facility for large, heterogeneous distributed computer systems , 1993, Softw. Pract. Exp..

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

[3]  S.P. Dandamudi,et al.  A hierarchical load sharing policy for distributed systems , 1997, Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

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

[5]  Miron Livny,et al.  Profiling Workstations' Available Capacity for Remote Execution , 1987, Performance.

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

[7]  Marvin Theimer,et al.  Finding idle machines in a workstation-based distributed system , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[8]  Teunis J. Ott,et al.  Load-balancing heuristics and process behavior , 1986, SIGMETRICS '86/PERFORMANCE '86.

[9]  R. Chawla,et al.  The Stealth distributed scheduler , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[10]  Sivarama P. Dandamudi,et al.  Performance of Hierarchical Load Sharing in Heterogeneous Distributed Systems , 1996 .

[11]  S. Zhou,et al.  A Trace-Driven Simulation Study of Dynamic Load Balancing , 1987, IEEE Trans. Software Eng..

[12]  Sivarama P. Dandamudi.  Performance impact of scheduling discipline on adaptive load sharing in homogeneous distributed systems , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

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

[14]  Anna Hác,et al.  Dynamic Load Balancing in a Distributed System Using a Decentralized Algorithm , 1987, ICDCS.

[15]  芦原 評.  Adaptive load sharing in distributed systems , 1992 .

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

[17]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

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

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

[20]  Phillip Krueger,et al.  A comparison of preemptive and non-preemptive load distributing , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[21]  Thomas Kunz,et al.  The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme , 1991, IEEE Trans. Software Eng..

[22]  Satish K. Tripathi,et al.  SAHAYOG: A test bed for evaluating dynamic load‐sharing policies , 1989, Softw. Pract. Exp..