Finish time predictability of Earliest Deadline Zero Laxity algorithm for multiprocessor real-time systems
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.
finish time predictability earliest deadline zero laxity multiprocessor embedded real-time system priority-driven scheduling