An evaluation of heuristics for SLA based parallel job scheduling

Viktor Yarmolenko; Rizos Sakellariou

doi:10.1109/IPDPS.2006.1639654

An evaluation of heuristics for SLA based parallel job scheduling

Viktor Yarmolenko
, Rizos Sakellariou

Research output: Chapter in Book/Conference proceeding › Conference contribution

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. © 2006 IEEE.

Original language	English
Title of host publication	20th International Parallel and Distributed Processing Symposium, IPDPS 2006\|20th Int. Parallel Distrib. Process. Symp. IPDPS 2006
Volume	2006
DOIs	https://doi.org/10.1109/IPDPS.2006.1639654
Publication status	Published - 2006

Keywords

WP6

Access to Document

10.1109/IPDPS.2006.1639654

Cite this

@inproceedings{f8ebdabf1e354eeda75f9ca56303645e,

title = "An evaluation of heuristics for SLA based parallel job scheduling",

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. {\textcopyright} 2006 IEEE.",

keywords = "WP6",

author = "Viktor Yarmolenko and Rizos Sakellariou",

note = "9 cites: http://scholar.google.com/scholar?cites=7981500046188158176",

year = "2006",

doi = "10.1109/IPDPS.2006.1639654",

language = "English",

isbn = "1424400546",

volume = "2006",

booktitle = "20th International Parallel and Distributed Processing Symposium, IPDPS 2006|20th Int. Parallel Distrib. Process. Symp. IPDPS 2006",

}

TY - GEN

T1 - An evaluation of heuristics for SLA based parallel job scheduling

AU - Yarmolenko, Viktor

AU - Sakellariou, Rizos

N1 - 9 cites: http://scholar.google.com/scholar?cites=7981500046188158176

PY - 2006

Y1 - 2006

N2 - 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. © 2006 IEEE.

AB - 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. © 2006 IEEE.

KW - WP6

U2 - 10.1109/IPDPS.2006.1639654

DO - 10.1109/IPDPS.2006.1639654

M3 - Conference contribution

SN - 1424400546

SN - 9781424400546

VL - 2006

BT - 20th International Parallel and Distributed Processing Symposium, IPDPS 2006|20th Int. Parallel Distrib. Process. Symp. IPDPS 2006

ER -

An evaluation of heuristics for SLA based parallel job scheduling

Abstract

Keywords

Access to Document

Fingerprint

Cite this