Trace-Based Simulations of Processor Co-Allocation Policies in Multiclusters

Authors:
A. I. D. Bucur;D. H. J. Epema
Affiliations:
-;-
Venue:
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Year:
2003

Citing 0
Cited 10

GUARD: Gossip Used for Autonomous Resource Detection

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
DGSim: Comparing Grid Resource Management Architectures through Trace-Based Simulation

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Model-based simulation and performance evaluation of grid scheduling strategies

Future Generation Computer Systems
Grid broker selection strategies using aggregated resource information

Future Generation Computer Systems
Grids with multiple batch systems for performance enhancement of multi-component and parameter sweep parallel applications

Future Generation Computer Systems
On grid performance evaluation using synthetic workloads

JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
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
Improving grid performance through processor allocation considering both speed heterogeneity and resource fragmentation

The Journal of Supercomputing
Large improvements in application throughput of long-running multi-component applications using batch grids

Concurrency and Computation: Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 simultaneous allocation of processors to single jobs in multiple clusters, may be required. In this paper we study the performance of several scheduling policies for co-allocating unordered requests in multiclusters with a workload derived from the DAS. We .nd that beside the policy, limiting the total job size significantly improves the performance, and that for a slowdown of jobs due to global communication bounded by 1.25, co-allocation is a viable choice.