A DMR Fair Algorithm for Realtime Scheduler

Author

Shi-jun, Zhang ; Xin, Yu ; Shao-Hua, Yu ; Ben-xiong, Huang

Author_Institution

Dept. of Electron & Inf., Huazhong Univ. of Sci. & Technol., China

Volume

1

fYear

2008

fDate

13-15 Dec. 2008

Firstpage

362

Lastpage

366

Abstract

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.

Keywords

media streaming; scheduling; BACKSLASH algorithm; DMR fair algorithm; deadline miss ratio; earliest deadline first; expectative execution time; media streaming; service quality; soft real time scheduling algorithms; Application software; Computer science; Dynamic scheduling; Electrons; Jitter; Processor scheduling; Real time systems; Resource management; Scheduling algorithm; Streaming media;

fLanguage

English

Publisher

ieee

Conference_Titel

Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on

Conference_Location

Hainan Island

Print_ISBN

978-0-7695-3431-2

Type

conf

DOI

10.1109/FGCN.2008.98

Filename

4734122