Optimal Scheduling of Urgent Preemptive Tasks

Abstract

Tasks’ scheduling has always been a central problem in the embedded real-time systems community. As in general the scheduling problem is NP-hard, researchers have been looking for efficient heuristics to solve the scheduling problem in polynomial time. One of the most important scheduling strategies is the Earliest Deadline First (EDF). It is known that EDF… (More)
DOI: 10.1109/RTCSA.2010.20

Topics

  • Presentations referencing similar topics