Clairvoyant site allocation of jobs with highly variable service demands in a computational grid
Authors:
- 1 April 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
In this paper we evaluate performance of three different site allocation policies in a 2-level computational grid with heterogeneous sites. We consider that schedulers are aware of service demands of jobs which show high variability. A simulation model is used to evaluate performance in terms of the average response time and slowdown, under medium and high load. Simulation results show that the proposed policy outperforms the other two that are examined, especially at high load.Keywords
This publication has 14 references indexed in Scilit:
- Communication cost effective scheduling policies of nonclairvoyant jobs with load balancing in a gridJournal of Systems and Software, 2009
- Asymptotic Analysis of Load Distribution for Size-Interval Task Allocation with Bounded Pareto Job Sizes2008
- Provably Efficient Online Nonclairvoyant Adaptive SchedulingIEEE Transactions on Parallel and Distributed Systems, 2008
- Resource Allocation Strategies in a 2-Level Hierarchical Grid System41st Annual Simulation Symposium (anss-41 2008), 2008
- Game-Theoretic Approach for Load Balancing in Computational GridsIEEE Transactions on Parallel and Distributed Systems, 2007
- Systems with multiple servers under heavy-tailed workloadsPerformance Evaluation, 2005
- Enhancements to the Decision Process of the Self-Tuning dynP SchedulerLecture Notes in Computer Science, 2005
- Asymptotic convergence of scheduling policies with respect to slowdownPerformance Evaluation, 2002
- A Methodology for Account Management in Grid Computing Environments2001
- On Choosing a Task Assignment Policy for a Distributed Server SystemJournal of Parallel and Distributed Computing, 1999