A new real-time scheduling algorithm for continuous media tasks

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.

A Real-Time Scheduling Algorithm for Soft Periodic Tasks

“…Modified Proportional Share scheduling Algorithm (MPSSA) has been suggested in [9] for scheduling continuous media tasks. In this algorithm, two parameters are used for each task which are ticket and pass .…”

“…Therefore, these algorithms are required to have the strict admission control to prevent unpredictable behaviors when the overrun and overload conditions occur [3]. The strict admission control may cause low utilization of recourses [6,9]. In the present paper, to overcome the drawback of baseline algorithms in overrun and overload conditions and getting QoS requirements, we have proposed a scheduling algorithm that is called MMF.…”

Multimedia Task Scheduling using Proportion-based Genetic Algorithm

“…Recently, Modified Proportional Share (mPS) Scheduling algorithm is designed for continuous task in soft real-time system by authors (10) . The mPS scheduling algorithm shows better performance than rrPS scheduling algorithm for graceful degradation of performance under the overloaded condition and fewer context switching.…”