This project is supported in part by grants from DARPA and the National Science Foundation, and donations from Tektronix, Hewlett-Packard and the Portland Trail Blazers.
Proceedings of the Workshop on Resource Allocation Problems in Multimedia Systems
Adaptive computing systems, Real-time data processing, Scheduling -- Computer programs
CPU scheduling and admission testing for multimedia applications have been extensively studied, and various solutions have been proposed using assorted simplifying assumptions. However, we believe that the complexity and dynamic behavior of multimedia applications and systems make static solutions hard to apply in real-world situations. We are analyzing the difficulties that arise when applying the rate-monotonic (RM) scheduling algorithm and the corresponding admission tests for CPU management, in the context of real multimedia applications running on real systems. RM requires statically predictable, periodic workloads, and while multimedia applications appear to be periodic, in practice they exhibit numerous variabilities in workload. Our study suggests the need for more adaptive scheduling mechanisms, which would allow complex applications to dynamically respond to variations in workload and resource availability. Furthermore, we believe there is a need for a more abstract characterization of applications and resources for admission testing purposes. We conclude that adaptive CPU scheduling policies should address the needs of CPU scheduling and reservation for current multimedia applications.
Baiceanu, V., Cowan, C., McNamee, D., Pu, C., & Walpole, J. (1996, December). Multimedia applications require adaptive CPU scheduling. In Proceedings of the Workshop on Resource Allocation Problems in Multimedia Systems, Washington, DC.