Real-time scheduling of divisible loads in cluster computing environments

Xuan Lin, Anwar Mamat, Ying Lu, Jitender Deogun, Steve Goddard

Research output: Contribution to journalArticle

13 Scopus citations

Abstract

Cluster computing has become an important paradigm for solving large-scale problems. To enhance the quality of service (QoS) and provide performance guarantees in a cluster computing environment, various real-time scheduling algorithms and workload models have been investigated. Computational loads that can be arbitrarily divided into independent tasks represent many real-world applications. However, the problem of providing performance guarantees to divisible load applications has only recently been studied systematically. In this work, three important and necessary design decisions, (1) workload partitioning, (2) node assignment, and (3) task execution order, are identified for real-time divisible load scheduling. A scheduling framework that can configure different policies for each of the three design decisions is proposed and used to generate various algorithms. This paper systematically studies these algorithms and identifies scenarios where the choices of design parameters have significant effects.

Original languageEnglish (US)
Pages (from-to)296-308
Number of pages13
JournalJournal of Parallel and Distributed Computing
Volume70
Issue number3
DOIs
Publication statusPublished - Mar 1 2010

    Fingerprint

Keywords

  • Cluster computing
  • Divisible load
  • Parallel computing
  • QoS
  • Real-time scheduling

ASJC Scopus subject areas

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

Cite this