Scheduling Mechanisms Reducing Contention Situations in Multimedia Systems

Multimedia applications have time dependancies and require appropriate resource management and scheduling mechanisms. Additionally, such applic ations have typically large resource requirements, hence, methods to red uce these requirements are desirable. Contention situations occur when the execution of processes overlaps in time. This leads to additional management efforts like context switches and to the increasing demand f or resources like memory space. In this paper we present alternative schedulin g methods suitable for real-time processes in multimedia systems. These methods serialize the execution of processes in order to reduce the occurence of overlap s. On the basis of measurements the described scheduling mechanisms are ev aluated concerning their effectiveness and the required expenses.

Important Copyright Notice:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

If the paper is not available from this page, you might contact the authors directly via the "People" section on our KOM Homepage.