Most multimedia applications require real-time tasks to meet their deadlines. For large web servers, multiprocessor support is indispensable to handle the large number of requests. Existing on-line scheduling algorithms such as Earliest Deadline First Algorithm (EDF) and Least Laxity Algorithm (LLA) may not be suitable for scheduling realtime tasks in multiprocessor systems. We propose a new on-line scheduling algorithm Earliest Deadline until Zero Laxity (EDZL). We show that EDZL is a suboptimal for two processors. Experimental results show that EDZL has low context switching overhead and low deadline miss rate.
展开▼
