A new real-time scheduling algorithm for continuous media tasks

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