Jin Hwan Kim

The KIPS Transactions:PartA, Vol. 9, No. 1, pp. 9-18, Mar. 2002
10.3745/KIPSTA.2002.9.1.9,   PDF Download:

Abstract

In this paper, we propose scalable scheduling techniques based on EDF to efficiently integrate hard real-time and multimedia soft real-time tasks in the distributed real-time multimedia database system. Hard tasks are guaranteed based on worst case execution times, whereas multimedia soft tasks are served based on mean execution times. This paper describes a served-based scheme for partitioning the CPU bandwidth among different task classes that coexist in the same system. To handle the problem of class overloads characterized by varying number of tasks and varying task arrival rates, this scheme shows how to adjust the fraction of the CPU bandwidth assigned to each class. This scheme fixes the maximum time that each hard task can execute in the period of the server, whereas it can dynamically change the bandwidth reserved to each multimedia task. The proposed method is capable of minimizing the mean tardiness of multimedia tasks, without jeopardizing the schedulability of the hard tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.

Statistics
Cite this article