Priority-enabled Scheduling for Resizable Parallel Applications

In this paper, we illustrate the impact of dynamic resizability on parallel scheduling. Our ReSHAPE framework includes an application scheduler that supports dynamic resizing of parallel applications. We propose and evaluate new scheduling policies made possible by our ReSHAPE framework. The framework also provides a platform to experiment with more interesting and sophisticated scheduling policies and scenarios for resizable parallel applications. The proposed policies support scheduling of parallel applications with and without user assigned priorities. Experimental results show that these scheduling policies significantly improve individual application turn around time as well as overall cluster utilization.

[1]  Dror G. Feitelson,et al.  Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling , 2001, IEEE Trans. Parallel Distributed Syst..

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

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

[4]  Rajesh Sudarsan,et al.  Scheduling resizable parallel applications , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[5]  Dror G. Feitelson,et al.  The workload on parallel supercomputers: modeling the characteristics of rigid jobs , 2003, J. Parallel Distributed Comput..

[6]  Allen B. Downey,et al.  A parallel workload model and its implications for processor allocation , 1996, Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183).

[7]  Francine Berman,et al.  A model for moldable supercomputer jobs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[8]  Richard L. Graham,et al.  Open MPI: A Flexible High Performance MPI , 2005, PPAM.

[9]  Uwe Schwiegelshohn,et al.  Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.

[10]  Jon B. Weissman.  Prophet: automated scheduling of SPMD programs in workstation networks , 1999, Concurr. Pract. Exp..

[11]  Uwe Schwiegelshohn,et al.  Parallel Job Scheduling - A Status Report , 2004, JSSPP.

[12]  Kenneth C. Sevcik,et al.  Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems , 1994, Perform. Evaluation.

[13]  Dror G. Feitelson,et al.  Packing Schemes for Gang Scheduling , 1996, JSSPP.

[14]  Jon B. Weissman,et al.  Integrated scheduling: the best of both worlds , 2003, J. Parallel Distributed Comput..

[15]  Giuseppe Serazzi,et al.  A Characterization of the Variation in Time of Workload Arrival Patterns , 1985, IEEE Transactions on Computers.

[16]  Fang Wang,et al.  Modeling of Workload in MPPs , 1997, JSSPP.

[17]  Francine Berman,et al.  Adaptive Selection of Partition Size for Supercomputer Requests , 2000, JSSPP.

[18]  Rajesh Sudarsan,et al.  Efficient Multidimensional Data Redistribution for Resizable Parallel Computations , 2007, ISPA.

[19]  Rajesh Sudarsan,et al.  ReSHAPE: A Framework for Dynamic Resizing and Scheduling of Homogeneous Applications in a Parallel Environment , 2007, 2007 International Conference on Parallel Processing (ICPP 2007).

[20]  Honbo Zhou,et al.  The EASY - LoadLeveler API Project , 1996, JSSPP.

[21]  Jon B. Weissman.  Prophet: automated scheduling of SPMD programs in workstation networks , 1999 .

[22]  Dan Tsafrir,et al.  Modeling User Runtime Estimates , 2005, JSSPP.