Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,324 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
AQuoSA
Atropos scheduler
Central processing unit
Computer hardware
Expand
Broader (1)
Real-time computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Modified earliest deadline first scheduling with channel quality indicator for downlink real-time traffic in LTE networks
M. Hamed
,
Suzan Shukry
,
M. El-Mahallawy
,
S. El-Ramly
International Conference on e-Technologies and…
2014
Corpus ID: 15401061
Long-Term Evolution (LTE) is a recently evolving technology. It offers very high speed for mobile sets with the same data rate as…
Expand
2013
2013
Improvement of earliest deadline first scheduling algorithm
Li Yu-cui
2013
Corpus ID: 63239211
In the process of service flow scheduling based on IEEE802.16d agreement,a good scheduling algorithm should ensure that higher…
Expand
Highly Cited
2009
Highly Cited
2009
An implementation of the earliest deadline first algorithm in Linux
Dario Faggioli
,
M. Trimarchi
,
Fabio Checconi
ACM Symposium on Applied Computing
2009
Corpus ID: 15119867
Recently, many projects have been started to introduce some real-time mechanisms into general purpose operating systems (GPOS) in…
Expand
2007
2007
Quantum-Based Earliest Deadline First Scheduling for Multiservices
T. Lim
,
Bu-Sung Lee
,
C. Yeo
IEEE transactions on multimedia
2007
Corpus ID: 206750923
Latency-rate (LR) schedulers have shown their ability in providing fair and weighted sharing of bandwidth with an upper bound on…
Expand
2007
2007
A C-space sensitivity analysis of Earliest Deadline First scheduling
J. Hermant
,
L. George
Leveraging Applications of Formal Methods
2007
Corpus ID: 10110587
Arrangement for sucking-off gases, creating by means of water supplied to an annular nozzle surrounding the outlet of a gas…
Expand
2006
2006
Ada Issue 00357: support for deadlines and earliest deadline first scheduling
A. Srivastava
ALET
2006
Corpus ID: 19492263
Direct support for deadlines is defined and a new dispatching policy for Earliest Deadline First (EDF) Scheduling is supported.
2002
2002
Fault-tolerant earliest deadline first scheduling with resource reclaim
Yu Chen
,
Xun Yu
,
Guang-ze Xiong
Fifth International Conference on Algorithms and…
2002
Corpus ID: 15948811
A fault-tolerant real-time scheduling algorithm through time redundancy, with a schedulability bound, is based on the worst…
Expand
2001
2001
Fault-Tolerant Earliest Deadline First Scheduling
Xiong Guang-ze
2001
Corpus ID: 64007697
Earliest deadline first scheduling (EDF) is an optimal dynamic preempt ive scheduling algorithm It is flexible, simple and…
Expand
Highly Cited
2000
Highly Cited
2000
Scheduling the CAN bus with earliest deadline techniques
M. Natale
Proceedings 21st IEEE Real-Time Systems Symposium
2000
Corpus ID: 195867427
Controller area networks (CANs) are widely used in real-time automobile control and are gaining wider acceptance as a standard…
Expand
1999
1999
Batching earliest deadline first scheduling
Maryam Moghaddas
,
B. Hamidzadeh
Proceedings. Fifth International Workshop on…
1999
Corpus ID: 2647176
Investigates the trade-off in the dynamic scheduling of real-time tasks, between the frequency at which the scheduling algorithm…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE