Efficient real-time divisible load scheduling

Anwar Mamat, Ying Lu, Jitender Deogun, Steve Goddard

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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
Issue number12
StatePublished - Dec 2012


  • 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


Dive into the research topics of 'Efficient real-time divisible load scheduling'. Together they form a unique fingerprint.

Cite this