Sciweavers

43 search results - page 2 / 9
» Unfairness Metrics for Space-Sharing Parallel Job Schedulers
Sort
View
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
JSSPP
1995
Springer
13 years 8 months ago
Time Space Sharing Scheduling and Architectural Support
In this paper, we describe a new job scheduling class, called \Time Space Sharing Scheduling" (TSSS) for dynamically partitionable parallel machines. As an instance of TSSS, ...
Atsushi Hori, Takashi Yokota, Yutaka Ishikawa, Shu...
EUROPAR
2004
Springer
13 years 10 months ago
Scheduling of MPI Applications: Self-co-scheduling
Scheduling parallel jobs has been an active investigation area. The scheduler has to deal with heterogeneous workloads and try to obtain throughputs and response times such that en...
Gladys Utrera, Julita Corbalán, Jesú...
JSSPP
2001
Springer
13 years 9 months ago
Metrics for Parallel Job Scheduling and Their Convergence
The arrival process of jobs submitted to a parallel system is bursty, leading to fluctuations in the load at many time scales. In particular, rare events of extreme load may occu...
Dror G. Feitelson
HPDC
2003
IEEE
13 years 10 months ago
Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema