Quantized EDF Scheduling in a Stochastic Environment

Authors:
Jeffery P. Hansen;John P. Lehoczky;Haifeng Zhu;Ragunathan Rajkumar
Affiliations:
-;-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 4
Cited 1

Dynamically Negotiated Resource Management for Data Intensive Application Suites

IEEE Transactions on Knowledge and Data Engineering
The Amaranth Framework: Probabilistic, Utility-Based Quality of Service Management for High-Assurance Computing

HASE '99 The 4th IEEE International Symposium on High-Assurance Systems Engineering
Real-Time Queueing Theory

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Probabilistic Bandwidth Reservation by Resource Priority Multiplexing

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)

A non-preemptive scheduling algorithm for soft real-time systems

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the efects of quantization on EDF (Earliest Deadline first) queues with a stochastic traffic model are presented. In a quantized EDF queue, jobs have limited fidelity in representing their relative deadlines. It is shown that most of the benefits of full EDF can be achieved with relative deadlines expressed in as little as three bits. The implications of this are that QoS networking technologies such as DifServ can be used to implement near EDF performance while still using no more than the standard set of bits in DS/TOS field.