Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Long-Term Evolution (LTE) is a recently evolving technology. It offers very high speed for mobile sets with the same data rate as… 
2013
2013
In the process of service flow scheduling based on IEEE802.16d agreement,a good scheduling algorithm should ensure that higher… 
Highly Cited
2009
Highly Cited
2009
Recently, many projects have been started to introduce some real-time mechanisms into general purpose operating systems (GPOS) in… 
2007
2007
Latency-rate (LR) schedulers have shown their ability in providing fair and weighted sharing of bandwidth with an upper bound on… 
2007
2007
Arrangement for sucking-off gases, creating by means of water supplied to an annular nozzle surrounding the outlet of a gas… 
2006
2006
Direct support for deadlines is defined and a new dispatching policy for Earliest Deadline First (EDF) Scheduling is supported. 
2002
2002
A fault-tolerant real-time scheduling algorithm through time redundancy, with a schedulability bound, is based on the worst… 
2001
2001
Earliest deadline first scheduling (EDF) is an optimal dynamic preempt ive scheduling algorithm It is flexible, simple and… 
Highly Cited
2000
Highly Cited
2000
  • M. Natale
  • 2000
  • Corpus ID: 195867427
Controller area networks (CANs) are widely used in real-time automobile control and are gaining wider acceptance as a standard… 
1999
1999
Investigates the trade-off in the dynamic scheduling of real-time tasks, between the frequency at which the scheduling algorithm…