2008 Second International Conference on Future Generation Communication and Networking A DMR Fair Algorithm for Realtime Scheduler December 13-December 15 ISBN: 978-0-7695-3431-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FGCN.2008.98
Earliest deadline first (EDF) is one of the most popular soft real time (SRT) scheduling algorithms being widely used. Slack time and overrun are the two key factors that will affect the performance. Reclaiming slack is a favorite approach that has been introduced to EDF. Adaptations of EDF tend to concentrate on reducing average deadline miss ratio (DMR) and improving average tardiness, while paying little attention to fairness of the service quality between tasks, which is important for streaming media applications. A DMR Fair EDF algorithm is proposed in this paper, which use expectative execution time as a factor, in addition to its deadline, when a task’s priority needs to be determined. In comparison with SLAD and BACKSLASH algorithm, the proposed algorithm brings a fair deadline miss ratio among tasks, with an acceptable ADMR and ATRD between SLAD’s and BACKSLASH’s.
Citation:
Zhang Shi-jun, Yu Xin, Yu Shao-hua, Huang Ben-xiong, "A DMR Fair Algorithm for Realtime Scheduler," fgcn, vol. 1, pp.362-366, 2008 Second International Conference on Future Generation Communication and Networking, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb