Optimal Scheduling for Real-Time Parallel Tasks*This work was supported by the Research Grant from Hallym University, Korea and the ITRC program of the Korea Ministry of Information & Communications under grant IITA-2005-(C1090-0502-0020).

  • Authors:

  • Wan Yeon Lee;Heejo Lee

  • Affiliations:

  • The author is with the Department of Computer Engineering, Hallym University, Chunchon 200--702, South Korea. E-mail: wanlee@hallym.ac.kr,;The author is with the Department of Computer Science and Engineering, Korea University, Seoul 136--713, South Korea.

  • Venue:
  • IEICE - Transactions on Information and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.