Book Chapter10.1007/BFB0000345
Disk Scheduling for Variable-Rate Data Streams
Jan Korst,Verus Pronk,Pascal Coumans +2 more
- 10 Sep 1997
- pp 119-132
10
TL;DR: Three disk scheduling algorithms that can be used in a multimedia server for sustaining a number of heterogeneous variable-rate data streams are described and compared with respect to buffer requirements as well as average response times.
read more
Abstract: We describe three disk scheduling algorithms that can be used in a multimedia server for sustaining a number of heterogeneous variable-rate data streams. A data stream is supported by repeatedly fetching a block of data from the storage device and storing it in a corresponding buffer. For each of the disk scheduling algorithms we give necessary and sufficient conditions for avoiding under- and overflow of the buffers. In addition, the algorithms are compared with respect to buffer requirements as well as average response times.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Prototyping of CMS storage management
Kjg Koen Holtman
- 01 Jan 2000
TL;DR: The final author version and the galley proof are versions of the publication after peer review and the final published version features the final layout of the paper including the volume, issue and page numbers.
Random duplicated assignment: an alternative to striping in video servers
Jan Korst
- 01 Nov 1997
TL;DR: An approach is presented for storing video data in large disk arrays that offers an interesting alternative to the well-known striping techniques, and results in smaller response times and lower disk and RAM costs if many continuous variablerate data streams have to be sustained simultaneously.
52
An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique
TL;DR: This paper proposes a new efficient algorithm, based on the breadth-first search approach, that is able to guarantee optimal solutions for RSP in O(n2 + mn), where m and n correspond of the number of data blocks and thenumber of disks, respectively.
15
Comparing disk scheduling algorithms for VBR data streams
TL;DR: A number of disk scheduling algorithms that can be used in a multimedia server for sustaining multiple variable-bit-rate (VBR) data streams are compared with respect to buffer requirements as well as average response times.
11
2D BubbleUp: Managing Parallel Disks for Media Servers
Edward Y. Chang,Hector Garcia-Molina,Chen Li +2 more
- 01 Jul 1998
TL;DR: This study presents a scheme called two-dimensional BubbleUp (2DB) for managing parallel disks in a multimedia server, which significantly reduces initial latency and maintains throughput comparable to that of the traditional schemes.
References
A case for redundant arrays of inexpensive disks (RAID)
David A. Patterson,Garth A. Gibson,Randy H. Katz +2 more
- 01 Jun 1988
TL;DR: Five levels of RAIDs are introduced, giving their relative cost/performance, and a comparison to an IBM 3380 and a Fujitsu Super Eagle is compared.
A statistical admission control algorithm for multimedia servers
Harrick M. Vin,Pawan Goyal,A. Goyal +2 more
- 15 Oct 1994
TL;DR: This paper presents an admission control algorithm for multimedia servers which exploits the variation in access times of media blocks from disk as well as the variations in client load induced by variable rate compression schemes, and provides statistical service guarantees to each client.
208
•Proceedings Article
Mon-Song Chen, Dilip D. Kandlur: Design and Analysis of a Grouped Sweeping Scheme for Multimedia Storage Management
Philip S. Yu
- 12 Nov 1992
TL;DR: The analysis shows that by properly setting the grouping factor the optimized GSS scheme can lead to substantially lower buffer requirement, particularly when compared with that of the round-robin scheme.
137
Design and analysis of a grouped sweeping scheme for multimedia storage management
Philip S. Yu,Mon Song Chen,Dilip D. Kandlur +2 more
- 12 Nov 1992
TL;DR: In this paper, an efficient grouped sweeping scheme (GSS) for disk scheduling to support multimedia applications is presented, which provides a formulation for balancing the two conflicting requirements: on the one hand we want to reduce the amount of seek delay, while on the other hand the worst case bound on the time between two consecutive services to the same request stream needs to be minimized.
123
Scheduling continuous media in a Video-On-Demand server
Kenchammana-Hosekote,Srivastava +1 more
- 15 May 1994
TL;DR: A model for scheduling storage devices to guarantee rate requirements for continuous media and transformations of the derived solution into one in the discrete domain while ensuring guaranteed data rate are discussed.
70