Abstract
In this paper, we study the problem of how to maximize the throughput of a continuous-media system, given fixed amounts of buffer space and disk bandwidth both predetermined at design time. Our approach is to maximize the utilizations of disk and buffers. We propose doing so in two ways. First, we analyze a scheme that allows multiple streams to share buffers. Our analysis and preliminary simulation results indicate that buffer sharing could lead to as much as 50% reduction in total buffer requirement. Second, we develop three prefetching strategies: SP, IP1 and IP2. As demonstrated by SP, straightforward prefetching is not effective at all. In contrast, IP1 and IP2, which prefetch more intelligently than does SP, could be valuable in maximizing the effective use of buffers and disk. Our preliminary simulation results show that IP1 and IP2 could lead to a 40% improvement in throughput.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson D, Osawa Y, Govindan R (1992) A file system for continuous media. ACM Trans Computer Systems 10:4
Chen M, Kandlur D, Yu P (1993) Optimization of the grouped sweeping scheduling with heterogeneous multimedia streams. Proc ACM-Multimedia, pp 235–242
Gemmell J (1993) Multimedia network file servers: multi-channel delay sensitive data retrieval. Proc ACM-Multimedia, pp243-250
Gemmell J, Christodoulakis S (1992) Principles of delay-sensitive multimedia data storage and retrieval. ACM Trans Information Systems 10(l):51–90
Goldman-Segall R (1990) Learning constellations: a multimedia research environment for exploring children’s theory-making. In: Harel I (ed) Constructionist learning. MIT Media Laboratory, Cambridge MA
Makaroff D, Ng R (1994) Schemes for implementing buffer sharing in continuous-media systems. Information Systems 20(6):445–464
Miller G, Baber G, Gilliland M (1993) News on-demand for multimedia networks. Proc ACM-Multimedia, pp 383–392
Neufeld G, Hutchinson N, Ng R, Ito M (1993) A distributed continuous-media file system. CITR grant proposal
Ng R, Faloutsos C, Sellis T (1991) Flexible buffer allocation based on marginal gains. Proc ACM-SIGMOD, pp 387–396
Patterson D, Gibson G, Katz R (1988) A case for redundant arrays of inexpensive disks (RAID). Proc ACM-SIGMOD, pp 109–116
Venkat Rangan P, Vin H (1991) Designing file systems for digital video and audio. Proceedings of the ACM Symposium on Operating Systems Principles, pp 69–79
Reddy A, Wyllie J (1993) Disk scheduling in a multimedia I/O system. Proc ACM-Multimedia, pp 225–233
Rowe L, Smith B (1992) A continuous media player. Proceedings of the 3rd International Workshop on Network and OS Support for Digital Audio and Video
Tindell K, Burns A (1993) Scheduling hard real-time multimedia disk traffic. Technical Report, University of York, UK
Tobagi FA, Pang J, Baird R, Gang M (1993) Streaming raida disk array management system for video files. Proc ACM-Multimedia, pp 393–400
Vin H, Goyal A, Goyal P (1995) Algorithms for designing large-scale multimedia servers. Computer Communications, March 1995
Vin H, Rao S, Goyal P (1995) Optimizing the placement of multimedia objects on disk arrays. Proceedings of the IEEE International Conference on Multimedia Computing and Systems
Yu C, Sun W, Bitton D, Yang Q, Bruno R (1989) Efficient placement of audio data on optical disks for real-time applications. Commun ACM 32(7):862–871
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ng, R.T., Yang, J. An analysis of buffer sharing and prefetching techniques for multimedia systems. Multimedia Systems 4, 55–69 (1996). https://doi.org/10.1007/s005300050012
Issue Date:
DOI: https://doi.org/10.1007/s005300050012