An EDF-Based Restricted-Migration Scheduling Algorithm for Multiprocessor Soft Real-Time Systems

Download Now
Provided by: University of North Carolina
Topic: Hardware
Format: PDF
There has been much recent interest in the use of the Earliest-Deadline-First (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In hard real-time systems, a significant disparity exists between EDF-based schemes and Pfair scheduling: on M processors, the worst-case schedulable utilization for all known EDF variants is approximately M/2, whereas it is M for optimal Pfair algorithms. This is unfortunate because EDF-based algorithms entail lower scheduling and task-migration overheads. However, such a disparity in schedulability can be alleviated by easing the requirement that all deadlines be met, which may be sufficient for soft real-time systems.
Download Now

Find By Topic