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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
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
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
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
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
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
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
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
  • 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
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
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?