FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2018
010020019792018

Related topics

Related topics

22 relations
AQuoSACentral processing unitComputer hardwareCritical section
(More)

Broader (1)

Real-time computing

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Earliest deadline first scheduling
Central processing unit
Real-time computing
Linux
Virtual machine
Real-time operating system

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Earliest-deadline first scheduling of multiple independent dataflow graphs
Static dataflow graphs are widely used in design of concurrent real-time streaming applications on multiprocessor systems-on-chip… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Buffer minimization in earliest-deadline first scheduling of dataflow graphs
Symbolic schedulability analysis of dataflow graphs is the process of synthesizing the timing parameters (i.e. periods, phases… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
A group priority earliest deadline first scheduling algorithm
In most priority scheduling algorithms, the number of priority levels is assumed to be unlimited. However, if a task set requires… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
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… (More)
  • 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… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 2
  • figure 6
Is this relevant?
2007
2007
Quantum-Based Earliest Deadline First Scheduling for Multiservices
Latency-rate (LR) schedulers have shown their ability in providing fair and weighted sharing of bandwidth with an upper bound on… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table I
Is this relevant?
2007
2007
A C-space sensitivity analysis of Earliest Deadline First scheduling
This paper presents a sensitivity analysis for the dimensioning of real-time systems in which sporadic tasks are executed… (More)
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… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2002
2002
Fault-tolerant earliest deadline first scheduling with resource reclaim
A fault-tolerant real-time scheduling algorithm through time redundancy, with a schedulability bound, is based on the worst… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Probabilistic End-to-End Delay Bounds for Earliest Deadline First Scheduling
We analyze the Earliest-Deadline-First (EDF) scheduling discipline within the framework of statistical multiplexing. We derive… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?