Download:
|
by Darin England, Jon B. Weissman
Proceedings of the 10th Job Scheduling Strategies for Parallel Processing, volume 3277 of Lecture Notes in Computer Science (LNCS
http://www.cs.huji.ac.il/~feit/parsched/p-04-8.ps.gz
Add To MetaCart
Abstract:
Abstract--- We present an analysis of the costs and benefits of load sharing of parallel jobs in the computational grid. We begin with a workload generation model that captures the essential properties of parallel jobs and use it as input to a grid simulation model. Our experiments are performed for both homogeneous and heterogeneous grids. We measured average job slowdown with respect to both local and remote jobs and we show that, with some reasonable assumptions concerning the migration policy, load sharing proves to be beneficial when the grid is homogeneous, and that load sharing can adversely affect job slowdown for lightly-loaded machines in a heterogeneous grid. With respect to the number of sites in a grid, we find that the benefits obtained by load sharing do not scale well. Small to modest-size grids can employ load sharing as effectively as largescale grids. We also present and evaluate an effective scheduling heuristic for migrating a job within the grid. I.
Citations
|
982
|
The Grid: Blueprint for a New Computing Infrastructure
– Foster, Kesselman
- 1999
|
|
728
|
Simulation modeling and analysis
– Law, Kelton
- 2000
|
|
345
|
Adaptive load sharing in homogeneous distributed systems
– Eager, Lazowska, et al.
- 1986
|
|
107
|
Statistics with Reliability, Queueing and Computer Science Applications,” First Edition
– Trivedi, “Probability
|
|
71
|
Predicting Application Run Times Using Historical Information
– Smith, Foster, et al.
- 1998
|
|
32
|
A comprehensive model of the supercomputer workload
– Cirne, Berman
- 2001
|
|
21
|
A comparative study of real workload traces and synthetic workload models for parallel job scheduling
– Lo, Mache, et al.
- 1998
|
|
16
|
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling
– Mu'alem, Feitelson
- 2001
|
|
10
|
Fundamentals of queueing theory. 2-nd ed
– Gross, Harris
- 1985
|
|
7
|
Imprecise calendars: an approach to scheduling computational grids
– Hollingsworth, Maneewongvatana
- 1999
|
|
2
|
Packing schemes for gang scheduling," in Job Scheduling Strategies for Parallel Processing
– Feitelson
- 1996
|
|
1
|
et al., "Distributed job scheduling on computational grids using multiple simultaneous requests
– Subramani
- 2002
|
|
1
|
et al., "Predicting the performance of wide area data transfers
– Vazhkudai
- 2002
|
