Share Email Print

Proceedings Paper

Disk scheduling for multimedia data streams
Author(s): Steve J. Daigle; Jay K. Strosnider
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents a framework for reasoning about the timing correctness of multimedia data streams supported on a shared, serially-reusable server. A real-time scheduling approach is used to guarantee the timing requirements for multimedia applications such as video-on- demand and multimedia presentations. This framework incorporates the use of scheduling models, which are defined as abstractions that can be used to reason about timing correctness on physical resources. The scheduling models in this paper can be applied to multimedia systems which use periodic tasks to retrieve data from a disk. With their use, the multimedia system designer can reason a priori about the throughput, capacity, and schedulability of a system. The models enable the real-time system architect to quickly explore the system design space, to establish and maintain a firm performance baseline, to optimize system configuration parameters, and to explore the impact of new technologies. As an example of the application of this framework a new disk policy called T-scan is developed here. T-scan is applied to a multimedia task set and the analytical results are presented. Additionally, the performance of various disk policies are compared using the framework.

Paper Details

Date Published: 1 April 1994
PDF: 12 pages
Proc. SPIE 2188, High-Speed Networking and Multimedia Computing, (1 April 1994); doi: 10.1117/12.171701
Show Author Affiliations
Steve J. Daigle, Bell Communications Research (United States)
Jay K. Strosnider, Carnegie Mellon Univ. (United States)

Published in SPIE Proceedings Vol. 2188:
High-Speed Networking and Multimedia Computing
Arturo A. Rodriguez; Mon-Song Chen; Jacek Maitan, Editor(s)

© SPIE. Terms of Use
Back to Top