On-line multiprocessor scheduling algorithms for real-time tasks

The existing on-line scheduling algorithms EDA (Earliest Deadline Algorithm) and LLA (Least Laxity Algorithm) are not sufficient for scheduling real-time sporadic tasks in multiprocessor systems. EDA has low context switching overhead but suffers from "multiple processor anomalies". LLA has good scheduling power, but the potential for high context switching overhead. We propose a new on-line scheduling algorithm EDZL which has both good scheduling power and low context switching overhead even in multiprocessor systems.<
>