Although theoretical results have been established regarding the utility of pre-emptive scheduling in reducing average job turn-around time, job suspension/restart is not much used in practice at supercomputer centers for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of pre-emptive scheduling. We explore this issue through a simulationbased study, using job logs from a supercomputer center. We develop a tunable selective-suspension strategy, and demonstrate its effectiveness. We also present new insights into the effect of pre-emptive scheduling on different job classes and address the impact of suspensions on worstcase slowdown
Parallel job scheduling on cluster computers involves the usage of several strategies to maximize bo...
An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Con...
The problem of producing efficient parallel programs against different possible execution orders or ...
Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interr...
This paper analyzes job scheduling for parallel computers by using theoretical and experimental mean...
In order to offer on-demand computing services as well as improve overall job throughput, the San Di...
Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when...
Preemptions account for a non-negligible overhead during system execution. There has been substantia...
grantor: University of TorontoMultiprocessors are being used increasingly to support workl...
Schedulability analysis of real-time systems requires the knowledge of the worst-case execution time...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...
The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set o...
Abstract: This paper proposes a new scheduler to schedule parallel jobs on Clusters that may be part...
Jeff Edmonds y Donald D. Chinn y Tim Brecht y Xiaotie Deng y Department of Computer Science Y...
International audienceWe study the classical problem of scheduling a set of independent jobs with re...
Parallel job scheduling on cluster computers involves the usage of several strategies to maximize bo...
An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Con...
The problem of producing efficient parallel programs against different possible execution orders or ...
Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interr...
This paper analyzes job scheduling for parallel computers by using theoretical and experimental mean...
In order to offer on-demand computing services as well as improve overall job throughput, the San Di...
Preemptive and non-preemptive scheduling paradigms typically introduce undesirable side effects when...
Preemptions account for a non-negligible overhead during system execution. There has been substantia...
grantor: University of TorontoMultiprocessors are being used increasingly to support workl...
Schedulability analysis of real-time systems requires the knowledge of the worst-case execution time...
We consider the classical problem of scheduling jobs in a multiprocessor setting in order to minimiz...
The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set o...
Abstract: This paper proposes a new scheduler to schedule parallel jobs on Clusters that may be part...
Jeff Edmonds y Donald D. Chinn y Tim Brecht y Xiaotie Deng y Department of Computer Science Y...
International audienceWe study the classical problem of scheduling a set of independent jobs with re...
Parallel job scheduling on cluster computers involves the usage of several strategies to maximize bo...
An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Con...
The problem of producing efficient parallel programs against different possible execution orders or ...