Optimal Scheduling for Real-Time Parallel Tasks

Wan Yeon LEE
Heejo LEE

IEICE TRANSACTIONS on Information and Systems   Vol.E89-D    No.6    pp.1962-1966
Publication Date: 2006/06/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.6.1962
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Algorithm Theory
optimal algorithm,  real-time scheduling,  feasible schedule,  bounded parallelism,  

Full Text: PDF>>
Buy this Article

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(M2N2) in the worst case, where M and N are the number of tasks and the number of processors, respectively.