Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Value vs. deadline scheduling in overload conditions
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Scheduling Communication Networks Carrying Real-Time Traffic
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Optimal Partitioning for Quantized EDF Scheduling
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Optimality of the Stochastic Earliest Deadline Policy for the G/M/c Queue Serving Customers with Deadlines
Efficient and flexible fair scheduling of real-time tasks on multiprocessors
Efficient and flexible fair scheduling of real-time tasks on multiprocessors
Performance guarantee for EDF under overload
Journal of Algorithms
Diff-EDF: A Simple Mechanism for Differentiated EDF Service
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Hi-index | 0.00 |
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.