Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor

Minkyu PARK  Sangchul HAN  Heeheon KIM  Seongje CHO  Yookun CHO  

IEICE TRANSACTIONS on Information and Systems   Vol.E88-D   No.3   pp.658-661
Publication Date: 2005/03/01
Online ISSN: 
DOI: 10.1093/ietisy/e88-d.3.658
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: System Programs
multiprocessor,  real-time,  scheduling,  periodic,  deadline,  

Full Text: PDF(175.4KB)>>
Buy this Article

Multiprocessor architecture becomes common on real-time systems as the workload of real-time systems increases. Recently new deadline-based (EDF-based) multiprocessor scheduling algorithms are devised, and comparative studies on the performance of these algorithms are necessary. In this paper, we compare EDZL, a hybrid of EDF and LLF, with other deadline-based scheduling algorithms such as EDF, EDF-US[m/(2m-1)], and fpEDF. We show EDZL schedules all task sets schedulable by EDF. The experimental results show that the number of preemptions of EDZL is comparable to that of EDF and the schedulable utilization bound of EDZL is higher than those of other algorithms we consider.