Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
IEEE Transactions on Parallel and Distributed Systems
Fair resource sharing in hierarchical virtual organizations for global grids
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Future Generation Computer Systems
An adaptive multisite mapping for computationally intensive grid applications
Future Generation Computer Systems
Deadline-guarantee-enhanced co-allocation for parameter sweep application in grid
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Multisite co-allocation algorithms for computational grid
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A dynamic co-allocation service in multicluster systems
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Performance-Aware load balancing for multiclusters
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
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.