Communications of the ACM
Processor allocation policies for message-passing parallel computers
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Condor-G: A Computation Management Agent for Multi-Institutional Grids
Cluster Computing
Fair Share on High Performance Computing Systems: What Does Fair Really Mean?
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Entropia: architecture and performance of an enterprise desktop grid system
Journal of Parallel and Distributed Computing - Special issue on computational grids
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
GRENCHMARK: A Framework for Analyzing, Testing, and Comparing Grids
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Communication-Aware Job Placement Policies for the KOALA Grid Scheduler
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Falkon: a Fast and Light-weight tasK executiON framework
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
KOALA: a co-allocating grid scheduler
Concurrency and Computation: Practice & Experience
How are Real Grids Used? The Analysis of Four Grid Traces and Its Implications
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Scheduling malleable applications in multicluster systems
CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
The design and implementation of the KOALA co-allocating grid scheduler
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
| Hi-index | 0.00 |
The use of today's multicluster grids exhibits periods of submission bursts with periods of normal use and even of idleness. To avoid resource contention, many users employ observational scheduling, that is, they postpone the submission of relatively low-priority jobs until a cluster becomes (largely) idle. However, observational scheduling leads to resource contention when several such users crowd the same idle cluster. Moreover, this job execution model either delays the execution of more important jobs, or requires extensive administrative support for job and user priorities. Instead, in this work we investigate the use of cycle scavenging to run jobs on grid resources politely yet efficiently, and with an acceptable administrative cost. We design a two-level cycle scavenging scheduling architecture that runs unobtrusively alongside regular grid scheduling. We equip this scheduler with two novel cycle scavenging scheduling policies that enforce fair resource sharing among competing cycle scavenging users. We show through experiments with real and synthetic applications in a real multicluster grid that the proposed architecture can execute jobs politely yet efficiently.