Sciweavers

Share
PDPTA
2004

Evaluation of a Job Admission Algorithm for Bandwidth Constrained Grids

9 years 6 months ago
Evaluation of a Job Admission Algorithm for Bandwidth Constrained Grids
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set of resources to use for each submitted job, especially when we take network usage into consideration. To address this problem, we introduce an integer linear programming model, which incorporates the functions of job admission control and resource assignation. Scheduling decisions are based on a cost model for resources. We analyse our algorithm in terms of job acceptance rate, resource utilization and average job queueing time. The results show the correctness of the model, and prove the importance of networkawareness in grid scheduling algorithms.
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where PDPTA
Authors Marc De Leenheer, Pieter Thysebaert, Bruno Volckaert, Filip De Turck, Bart Dhoedt, Piet Demeester
Comments (0)
books