Performance evaluation of gang scheduling in a two-cluster system with migrations

Gang scheduling is considered to be a highly effective task scheduling policy for distributed systems. In this paper we present a migration scheme which reduces the fragmentation in the schedule caused by gang scheduled jobs which cannot start. Furthermore, the existence of high priority jobs in the workload is addressed by the proposed strategy. High priority jobs need to be started immediately, which can in turn lead to the interruption of a parallel job's execution. A distributed system consisting of two homogeneous clusters is simulated to evaluate the performance. Our simulation results indicate that the proposed strategy can result in a performance boost.

[1]  H. Karatza.  SCHEDULING GANGS IN A DISTRIBUTED SYSTEM , 2006 .

[2]  Achim Streit.  Enhancements to the Decision Process of the Self-Tuning dynP Scheduler , 2004, JSSPP.

[3]  Averill M. Law,et al.  Simulation modelling and analysis , 1991 .

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

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

[6]  Dejan S. Milojicic,et al.  Process migration , 1999, ACM Comput. Surv..

[7]  Horst Langendörfer,et al.  Load balancing and fault tolerance in workstation clusters migrating groups of communicating processes , 1995, OPSR.

[8]  Helen D. Karatza.  A simulation-based performance analysis of gang scheduling in a distributed system , 1999, Proceedings 32nd Annual Simulation Symposium.

[9]  Xiaoying Wang,et al.  Multi-cluster Load Balancing Based on Process Migration , 2007, APPT.

[10]  Helen D. Karatza.  Gang scheduling performance on a cluster of non-dedicated workstations , 2002, Proceedings 35th Annual Simulation Symposium. SS 2002.

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

[12]  Helen D. Karatza.  Gang scheduling in a distributed system under processor failures and time-varying gang size , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[13]  Anand Sivasubramaniam,et al.  The Impact of Migration on Parallel Job Scheduling for Distributed Systems , 2000, Euro-Par.

[14]  Francis Neelamkavil.  Computer Simulation and Modelling , 1987 .

[15]  G. Watson,et al.  Computer simulation , 1988 .

[16]  Helen D. Karatza.  Scheduling in Distributed Systems , 2003, MASCOTS Tutorials.

[17]  Anand Sivasubramaniam,et al.  An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration , 2001, JSSPP.

[18]  Dror G. Feitelson,et al.  Improved Utilization and Responsiveness with Gang Scheduling , 1997, JSSPP.

[19]  Carsten Franke,et al.  On Grid Performance Evaluation Using Synthetic Workloads , 2006, JSSPP.