A Self-Tuning Job Scheduler Family with Dynamic Policy Switching
نویسنده
چکیده
The performance of job scheduling policies strongly depends on the properties of the incoming jobs. If the job characteristics often change, the scheduling policy should follow these changes. For this purpose the dynP job scheduler family has been developed. The idea is to dynamically switch the scheduling policy during runtime. In a basic version the policy switching is controlled by two parameters. The basic concept of the self-tuning dynP scheduler is to compute virtual schedules for each policy in every scheduling step. That policy is chosen which generates the ’best’ schedule. The performance of the self-tuning dynP scheduler no longer depends on a adequate setting of the input parameters. We use a simulative approach to evaluate the performance of the self-tuning dynP scheduler and compare it with previous results. To drive the simulations we use synthetic job sets that are based on trace information from four computing centers (CTC, KTH, PC2, SDSC) with obviously different characteristics.
منابع مشابه
The Self-Tuning dynP Job-Scheduler
In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The performance of the used scheduling policies (e.g. FCFS, SJF, LJF) depends on the characteristics of the queued jobs. Hence we developed the dynP scheduler family. The basic idea was to change between different scheduling pol...
متن کاملSelf-tuning job scheduling strategies for the resource management of HPC systems and computational grids
In this thesis we develop and study self-tuning job schedulers for resource management systems. Such schedulers search for the best solution among the available scheduling alternatives in order to improve the performance of static schedulers. In two domains of real world job scheduling this concept is implemented. First of all, we study the scheduling in resource management software for high pe...
متن کاملOn Performance Evaluation of a Slackness Option for the Self-Tuning dynP Scheduler
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to react on changing characteristics of the waiting jobs. In this paper we present an enhancement to the decision process of the self-tuning dynP scheduler. Adding slackness means, that the currently used policy is virtually ...
متن کاملEnhancements to the Decision Process of the Self-Tuning dynP Scheduler
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to react on changing characteristics of the waiting jobs. In this paper we present enhancements to the decision process of the self-tuning dynP scheduler and evaluate their impact on the performance: (i) While doing a self-tu...
متن کاملProvably Efficient Two-Level Adaptive Scheduling
Multiprocessor scheduling in a shared multiprogramming environment can be structured in two levels, where a kernel-level job scheduler allots processors to jobs and a user-level thread scheduler maps the ready threads of a job onto the allotted processors. This paper presents two-level scheduling schemes for scheduling “adaptive” multithreaded jobs whose parallelism can change during execution....
متن کامل