Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,827,086 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.
2017
2017
Cluster based Earliest Deadline First Scheduling approach for Wireless Sensor Networks
M. Kumaran
2017
Corpus ID: 54907776
The advancement of cluster based technique with real time scheduling algorithm earliest deadline first improves the success ratio…
Expand
2013
2013
Queuing aware earliest deadline first scheduling for cognitive radio network
S. Yusof
,
D. S. Shu'aibu
,
H. Hosseini
2013
Corpus ID: 60373677
Cognitive features enable wireless communications to utilize unoccupied spectrum with the least interference to the existing…
Expand
2008
2008
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
Sanjoy Baruah
,
T. Baker
Euromicro Conference on Real-Time Systems
2008
Corpus ID: 27580940
Recent results on the global multiprocessor EDF scheduling of sporadic task systems are, for the most part, applicable only to…
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.
2003
2003
Improved earliest-deadline-first scheduling method
박문주
2003
Corpus ID: 67373839
PURPOSE: An improved EDF(Earliest Deadline First) scheduling method on constant time complexity is provided to minimize execution…
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
1997
1997
Admissibility Tests for Interrupted Earliest Deadline First Scheduling with Priority Inheritance
Steven Sommer
,
J. M. Potter
1997
Corpus ID: 59875508
,Q VHFWLRQV DQG ZH SURYLGH D IRUPDO DQDO\VLV WR H[WHQG WKH (') VFKHGXODELOLW\ WHVW WR LQFOXGH FORFNHG LQWHUVSDFHG VSRUDGLF DQG…
Expand
Highly Cited
1994
Highly Cited
1994
Nonlocal electron kinetics in a low‐pressure inductively coupled radio‐frequency discharge
V. Kolobov
,
D. Beale
,
L. Mahoney
,
A. Wendt
1994
Corpus ID: 97809092
The Boltzmann equation for electrons is analyzed for a low‐pressure inductively coupled rf discharge in argon driven by a planar…
Expand