An Evaluation of Heuristics for SLA Based Parallel Job Scheduling
by
Viktor Yarmolenko
,
Rizos Sakellariou
| Citations: | 2 - 0 self |
BibTeX
@MISC{Yarmolenko_anevaluation,
author = {Viktor Yarmolenko and Rizos Sakellariou},
title = {An Evaluation of Heuristics for SLA Based Parallel Job Scheduling},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In the context of SLA based job scheduling for high performance grid computing, this paper investigates the behaviour of various scheduling heuristics to schedule SLA-bounded jobs onto a parallel computing resource. The key objective of this investigation is to evaluate the effectiveness of simple scheduling heuristics using as criteria the maximization of resource utilization (both in terms of time and SLAs serviced) and income. Our results suggest how each SLA constraint ought to be prioritized in order to improve the income. 1
Citations
| 13 | Dynamic Value-Density for Scheduling Real-Time Systems - Aldarmi, Burns |
| 10 | Service Overlay Networks: SLAs - Duan, Zhang, et al. - 2003 |
| 4 | GRUBER: A Grid Resource SLA-based Broker - Dumitrescu, Foster - 2005 |
| 4 | On the flexibility of WS-Agreement for job submission - Sakellariou, Yarmolenko - 2005 |
| 4 | SLA based job scheduling: A case study on policies for negotiation with resources. 4th All Hans Meeting - Yarmolenko - 2005 |
| 2 | Paper to GGF - ‘WS-Agreement’ - 2004 |
| 1 | The Service Level Agreement Manager: Control and Management of Phone Channel Bandwidth Over Premium IP Networks - D’Arienzo, Pescapè, et al. - 2002 |
