Efficient real-time divisible load scheduling

Anwar Mamat, Ying Lu, Jitender Deogun, Steve Goddard

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.

Original languageEnglish (US)
Pages (from-to)1603-1616
Number of pages14
JournalJournal of Parallel and Distributed Computing
Volume72
Issue number12
DOIs
StatePublished - Dec 1 2012

Fingerprint

Divisible Loads
Scheduling
Real-time
Schedule
Controller
Linear Algorithm
Performance Guarantee
Hybrid Algorithm
Efficient Algorithms
Controllers
Computing
Evaluate
Quality of service
Demonstrate
Simulation

Keywords

  • Arbitrarily divisible loads
  • Cluster computing
  • Real-time computing
  • Scheduling efficiency

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Efficient real-time divisible load scheduling. / Mamat, Anwar; Lu, Ying; Deogun, Jitender; Goddard, Steve.

In: Journal of Parallel and Distributed Computing, Vol. 72, No. 12, 01.12.2012, p. 1603-1616.

Research output: Contribution to journalArticle

Mamat, Anwar ; Lu, Ying ; Deogun, Jitender ; Goddard, Steve. / Efficient real-time divisible load scheduling. In: Journal of Parallel and Distributed Computing. 2012 ; Vol. 72, No. 12. pp. 1603-1616.
@article{5f71a3d20fa54e6a98239cdddb5e8310,
title = "Efficient real-time divisible load scheduling",
abstract = "Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.",
keywords = "Arbitrarily divisible loads, Cluster computing, Real-time computing, Scheduling efficiency",
author = "Anwar Mamat and Ying Lu and Jitender Deogun and Steve Goddard",
year = "2012",
month = "12",
day = "1",
doi = "10.1016/j.jpdc.2012.09.003",
language = "English (US)",
volume = "72",
pages = "1603--1616",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "12",

}

TY - JOUR

T1 - Efficient real-time divisible load scheduling

AU - Mamat, Anwar

AU - Lu, Ying

AU - Deogun, Jitender

AU - Goddard, Steve

PY - 2012/12/1

Y1 - 2012/12/1

N2 - Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.

AB - Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.

KW - Arbitrarily divisible loads

KW - Cluster computing

KW - Real-time computing

KW - Scheduling efficiency

UR - http://www.scopus.com/inward/record.url?scp=84867828228&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867828228&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2012.09.003

DO - 10.1016/j.jpdc.2012.09.003

M3 - Article

AN - SCOPUS:84867828228

VL - 72

SP - 1603

EP - 1616

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 12

ER -