Evaluation of an unfair decider mechanism for the self-tuning dynP job scheduler

Summary form only given. We present a new decider mechanism for the self-tuning dynP job scheduler for modern resource management systems. This scheduler switches the active scheduling policy dynamically during run time, in order to reject changing characteristics of waiting jobs. The new decider explicitly prefers a single scheduling policy instead of being fair to all available policies. We use discrete event simulations to evaluate the achieved slowdown and utilization and compare the results with the fair decider mechanism and the static basic scheduling policies. The evaluation shows that the self-tuning dynP scheduler in combination with the preferred decider achieves good results and that it is superior to common static scheduling approaches, which use only a single policy.

[1]  Francis HEYLIGHEN,et al.  Fitness as Default: the evolutionary basis of cognitive complexity reduction , 1994 .

[2]  Achim Streit On Job Scheduling for HPC-Clusters and the dynP Scheduler , 2001, HiPC.

[3]  Dror G. Feitelson,et al.  Metrics for Parallel Job Scheduling and Their Convergence , 2001, JSSPP.

[4]  Jörn Gehring,et al.  Architecture-Independent Request-Scheduling with Tight Waiting-Time Estimations , 1996, JSSPP.

[5]  James Patton Jones PBS: portable batch system , 2001 .

[6]  David A. Lifka,et al.  The ANL/IBM SP Scheduling System , 1995, JSSPP.

[7]  Achim Streit The self-tuning dynP job-scheduler , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  Axel Keller,et al.  Anatomy of a Resource Management System for HPC-Clusters , 2000 .

[9]  Thu D. Nguyen,et al.  Maximizing speedup through self-tuning of processor allocation , 1996, Proceedings of International Conference on Parallel Processing.

[10]  Dror G. Feitelson,et al.  Self-Tuning Systems , 1999, IEEE Softw..

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

[12]  Achim Streit A Self-Tuning Job Scheduler Family with Dynamic Policy Switching , 2002, JSSPP.

[13]  Kurt Kremer,et al.  Scheduling a metacomputer by an implicit voting system , 1994, Proceedings of 3rd IEEE International Symposium on High Performance Distributed Computing.

[14]  Achim Streit,et al.  Scheduling in HPC Resource Management Systems: Queuing vs. Planning , 2003, JSSPP.

[15]  Dror G. Feitelson,et al.  Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860 , 1995, JSSPP.

[16]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..

[17]  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..