A new real-time scheduling algorithm for continuous media tasks

Author

Yoo, M.R. ; Ahn, B. ; Lee, D.H. ; Kim, H.C.

Author_Institution

Sch. of Electr. Eng. & Comput. Sci., Yeungnam Univ., Kyungsan, South Korea

Volume

2

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

417

Abstract

Real time scheduling is one of important research areas, since there is great interest in multimedia services using Internet. This paper proposes a modified proportional share scheduling algorithm considering the characteristics of continuous media such as their continuity and time dependency. The proposed scheduling algorithm shows graceful degradation of performance in overloaded condition and decreases the number of context switching. The proposed algorithm is evaluated using several numerical simulations under various conditions. The results show that the number of context switching is decreased to 8% and the variation of the loss rate is reduced to 70% compared with the rate regulating proportional share algorithm under the overloaded condition

Keywords

multimedia communication; quality of service; real-time systems; scheduling; telecommunication computing; telecommunication congestion control; Internet; context switching; continuity; continuous media tasks; graceful performance degradation; modified proportional share scheduling algorithm; multimedia services; numerical simulations; overloaded condition; rate regulating proportional share algorithm; real-time scheduling algorithm; time dependency; Admission control; Computer science; Degradation; Delay effects; Dynamic scheduling; Graphics; Processor scheduling; Resource management; Scheduling algorithm; Video sharing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Computers and signal Processing, 2001. PACRIM. 2001 IEEE Pacific Rim Conference on

Conference_Location

Victoria, BC

Print_ISBN

0-7803-7080-5

Type

conf

DOI

10.1109/PACRIM.2001.953658

Filename

953658