Abstract. The evaluation of parallel job schedulers hinges on two things: the use of appropriate metrics, and the use of appropriate workloads on which the scheduler can operate. We argue that the focus should be on on-line open systems, and propose that a standard workload should be used as a benchmark for schedulers. This benchmark will specify dis-tributions of parallelism and runtime, as found by analyzing accounting traces, and also internal structures that create dierent speedup and syn-chronization characteristics. As for metrics, we present some problems with slowdown and bounded slowdown that have been proposed recently.
The analysis of workload traces from real production parallel machines can aid a wide variety of par...
International audienceToday, large scale parallel systems are available at relatively low cost. Many...
Abstract. Scheduling algorithms that use application and system knowl-edge have been shown to be mor...
The evaluation of parallel job schedulers hinges on the workloads used. It is suggested that this be...
There are many choices to make when evaluating the performance of a complex system. In the context o...
Abstract. We develop a new metric for job scheduling that in-cludes the effects of memory contention...
System administrators for parallel computers face many difficulties when managing job scheduling sys...
. Parallel job scheduling is beginning to gain recognition as an important topic that is distinct f...
Abstract The paper presents a metric that is well suited to evaluate online job sched-ules for massi...
grantor: University of TorontoMultiprocessors are being used increasingly to support workl...
This paper analyzes job scheduling for parallel computers by using theoretical and experimental mean...
A wide range of modern computer systems process workloads composed of parallelizable jobs. Data cent...
Abstract—Performance evaluation is a significant step in the study of scheduling algorithms in large...
Evaluating the performance of a computer system is based on using representative workloads. Common p...
. The space of job schedulers for parallel supercomputers is rather fragmented, because different r...
The analysis of workload traces from real production parallel machines can aid a wide variety of par...
International audienceToday, large scale parallel systems are available at relatively low cost. Many...
Abstract. Scheduling algorithms that use application and system knowl-edge have been shown to be mor...
The evaluation of parallel job schedulers hinges on the workloads used. It is suggested that this be...
There are many choices to make when evaluating the performance of a complex system. In the context o...
Abstract. We develop a new metric for job scheduling that in-cludes the effects of memory contention...
System administrators for parallel computers face many difficulties when managing job scheduling sys...
. Parallel job scheduling is beginning to gain recognition as an important topic that is distinct f...
Abstract The paper presents a metric that is well suited to evaluate online job sched-ules for massi...
grantor: University of TorontoMultiprocessors are being used increasingly to support workl...
This paper analyzes job scheduling for parallel computers by using theoretical and experimental mean...
A wide range of modern computer systems process workloads composed of parallelizable jobs. Data cent...
Abstract—Performance evaluation is a significant step in the study of scheduling algorithms in large...
Evaluating the performance of a computer system is based on using representative workloads. Common p...
. The space of job schedulers for parallel supercomputers is rather fragmented, because different r...
The analysis of workload traces from real production parallel machines can aid a wide variety of par...
International audienceToday, large scale parallel systems are available at relatively low cost. Many...
Abstract. Scheduling algorithms that use application and system knowl-edge have been shown to be mor...