The maximal utilization of processor co-allocation in multicluster systems
- 22 March 2004
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI Supercomputer (DAS), co-allocation, i.e., the simultaneous allocation of processors to single jobs in multiple clusters, may be required. In studies of scheduling in single clusters it has been shown that the achievable (maximal) utilization may be much less than 100%, a problem that may be aggravated in multicluster systems. In this paper we study the maximal utilization when co-allocating jobs in multicluster systems, both with analytic means (we derive exact and approximate formulas when the service-time distribution is exponential), and with simulations with synthetic workloads and with workloads derived from the logs of actual systems.Keywords
This publication has 11 references indexed in Scilit:
- On Advantages of Grid Computing for Parallel Job SchedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Resource co-allocation in computational gridsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Local versus Global Schedulers with Processor Co-allocation in Multicluster SystemsPublished by Springer Nature ,2002
- Optimizing parallel applications for wide-area clustersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Influence of Communication on the Performance of Co-allocationPublished by Springer Nature ,2001
- Characteristics of a Large Shared Memory Production WorkloadPublished by Springer Nature ,2001
- The distributed ASCI Supercomputer projectACM SIGOPS Operating Systems Review, 2000
- The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocationPublished by Springer Nature ,2000
- The ANL/IBM SP scheduling systemPublished by Springer Nature ,1995
- Maximum Processing Rates of Memory Bound SystemsJournal of the ACM, 1982