Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Earliest deadline first scheduling

Known as: EDF, Earliest dealine first scheduling 
Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real-time operating systems to place processes in a… Expand
Wikipedia

Related topics

Related topics

23 relations
AQuoSAAtropos schedulerCentral processing unitComputer hardware
Expand

Broader (1)

Real-time computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Data Assimilation in the Geosciences - An overview on methods, issues and perspectives.
We commonly refer to state-estimation theory in geosciences as data assimilation. This term encompasses the entire sequence of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2017
Review
2017
A Survey of Research into Mixed Criticality Systems
This survey covers research into mixed criticality systems that has been published since Vestal’s seminal paper in 2007, up until… Expand
Is this relevant?
2008
2008
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 3
  • table 4
Is this relevant?
2007
2007
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 2
  • figure 6
Is this relevant?
2005
2005
Non-preemptive earliest-deadline-first scheduling policy: a performance study
This paper introduces an analytical method for approximating the performance of a soft real-time system modeled by a single… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2004
2004
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
This paper introduces an analytical method for approximating the fraction of jobs that miss their deadlines in a real-time system… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Switched real-time ethernet with earliest deadline first scheduling protocols and traffic handling
There is a strong interest of using the cheap and simple Ethernet technology for industrial and embedded systems. This far… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Probabilistic end-to-end delay bounds for earliest deadline first scheduling
  • Matthew Andrews
  • Proceedings IEEE INFOCOM . Conference on Computer…
  • 2000
    • Corpus ID: 15574022
We analyze the earliest-deadline-first (EDF) scheduling discipline within the framework of statistical multiplexing. We derive… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Efficient aperiodic service under earliest deadline scheduling
We present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Stack-based scheduling of realtime processes
The Priority Ceiling Protocol (PCP) of Sha, Rajkumar and Lehoczky is a policy for locking binary semaphores that bounds priority… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE