Finish Time Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems

Sangchul HAN  Heeheon KIM  Xuefeng PIAO  Minkyu PARK  Seongje CHO  Yookun CHO  

IEICE TRANSACTIONS on Information and Systems   Vol.E89-D   No.12   pp.2981-2984
Publication Date: 2006/12/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.12.2981
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: System Programs
embedded real-time system,  multiprocessor,  priority-driven scheduling,  Earliest Deadline Zero Laxity,  finish time predictability,  

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

This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m+1)/2, where m is the number of processors.