Partitioned EDF scheduling: a closer look

Authors:
Sanjoy Baruah
Affiliations:
The University of North Carolina at Chapel Hill, Chapel Hill, USA
Venue:
Real-Time Systems
Year:
2013

Citing 7
Cited 1

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Real-Time Systems
Sustainable Scheduling Analysis

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A Lookup-Table Driven Approach to Partitioned Scheduling

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The partitioned EDF scheduling of implicit-deadline sporadic task systems upon identical multiprocessor platforms is considered. The problem is known to be intractable, but many different polynomial-time algorithms have been proposed for solving it approximately. These different approximation algorithms have previously been compared using utilization bounds; they are compared here using a different metric--the speedup factor. It is shown that from the perspective of their speedup factors, the best partitioning algorithms are those that (i) assign the tasks in decreasing order of utilization; and (ii) are "reasonable" in the sense that they will assign a task if there is capacity available on some processor--such algorithms include the widely-used First-Fit Decreasing, Best-Fit Decreasing, and Worst-Fit Decreasing partitioning heuristics.