Ensuring Fairness Among Participating Clusters During Multi-site Parallel Job Scheduling

Authors:
William M. Jones;Walter B. Ligon, III
Affiliations:
Clemson University, USA;Clemson University, USA
Venue:
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
Year:
2006

Citing 4
Cited 0

Enhanced Algorithms for Multi-site Scheduling

GRID '02 Proceedings of the Third International Workshop on Grid Computing
The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The Performance of Processor Co-Allocation in Multicluster Systems

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Characterization of Bandwidth-Aware Meta-Schedulers for Co-Allocating Jobs Across Multiple Clusters

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully mapping job's across potentially many clusters, jobs that would otherwise wait in the queue for local cluster resources can begin execution much earlier; thereby improving system utilization and reducing average queue waiting time. n this paper, we demonstrate that these multi-site scheduling techniques can be successfully integrated with fairness policies to ensure that participation in the multicluster is beneficial under extremely disparate workload intensities. Furthermore, we demonstrate that the trade-off between fairness and performance is relatively small.