Optimal scheduling for real-time parallel tasks

Wan Yeon Lee, Heejo Lee

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)


We propose an optimal algorithm for the real-time scheduling of parallel tasks on multiprocessors, where the tasks have the properties of flexible preemption, linear speedup, bounded parallelism, and arbitrary deadline. The proposed algorithm is optimal in the sense that it always finds out a feasible schedule if one exists. Furthermore, the algorithm delivers the best schedule consuming the fewest processors among feasible schedules. In this letter, we prove the optimality of the proposed algorithm. Also, we show that the time complexity of the algorithm is O(M2 · N2) in the worst case, where M and N are the number of tasks and the number of processors, respectively.

Original languageEnglish
Pages (from-to)1962-1966
Number of pages5
JournalIEICE Transactions on Information and Systems
Issue number6
Publication statusPublished - 2006 Jun


  • Bounded parallelism
  • Feasible schedule
  • Optimal algorithm
  • Real-time scheduling

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Optimal scheduling for real-time parallel tasks'. Together they form a unique fingerprint.

Cite this