An evaluation of heuristics for SLA based parallel job schedulin

Authors:
Viktor Yarmolenko;Rizos Sakellariou
Affiliations:
School of Computer Science, The University of Manchester, Manchester, UK;School of Computer Science, The University of Manchester, Manchester, UK
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 4
Cited 2

The service level agreement manager: control and management of phone channel bandwidth over Premium IP networks

ICCC '02 Proceedings of the 15th international conference on Computer communication
Service overlay networks: SLAs, QoS, and bandwidth provisioning

IEEE/ACM Transactions on Networking (TON)
On the flexibility of WS-agreement for job submission

MGC '05 Proceedings of the 3rd international workshop on Middleware for grid computing
GRUBER: a grid resource usage SLA broker

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Monitoring and Reputation Mechanisms for Service Level Agreements

GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
Advance reservation policies for workflows

JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing

Quantified Score

Hi-index	0.01

Visualization

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.