Abstract
Cycle based disk scheduling approach is widely used to satisfy the timing constraints of the multimedia data retrieval. While cycle based disk scheduling for multimedia data retrieval provides effective way of exploiting the disk bandwidth, it is possible that ongoing streams get exposed to jitter when the cycle is extended due to commencement of new session. In this article, we present the novel idea of avoiding temporal insufficiency of data blocks, jitter, which occurs due to the commencement of new session. We propose that sufficient amount of data blocks be available on memory such that the ongoing session can survive the cycle extension. This technique is called “pre-buffering”. We examine two different approaches in pre-buffering: (i) loads all required data blocks prior to starting retrieval and (ii) incrementally accumulates the data blocks in each cycle. We develop an elaborate model to determine the appropriate amount of data blocks necessary to survive the cycle extension and to compute startup latency involved in loading these data blocks. The simulation result shows that limiting the disk bandwidth utilization to 60% can greatly improve the startup latency as well as the buffer requirement for individual streams. The algorithm proposed in this work can be effectively incorporated into modern streaming server design.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Wijayaratne and A. L. N. Reddy, “Techniques for Improving the throughput of VBR Sreams,” presented at ACM/SPIE Multimedia Computing and Neworking, 1999.
P. Shenoy and H. M. Vin, “Cello: A Disk Scheduling Framwork for Next Generation Operating Systems,” presented at ACM Sigmetrics Conference, Madison, WI, USA, 1998.
W. J. Bolosky, R. P. Fitzgerald, and J. R. Douceur, “Distributed Schedule Management In The Tiger Video Fileserver,” ACM SIGOPS Operating Systems Review (ACM), vol. 31, 1997.
C. Ruemmler and J. Wilkes, “Introduction to Disk Drive Modeling,” Computer, vol. 27, pp. 7–28, 1994.
B. L. Worthington, G. R. Ganger, and Y. N. Patt, “Scheduling for Modern Disk Drives and non-random workloads,” University of Michigan CSE-TR-194-94, March 1994.
B. Ozden, A. Biliris, R. Rastogi, and A. Silberschatz, “A Low-Cost Storage Server for Movie on Demand Databases,” Proc. ofVLDB’ 94, 1994.
D. R. Kenchammana-Hosekote and J. Srivastava, “Scheduling Continuous Media on a Video-On-Demand Server,” Proc. of International Conference on Multi-media Computing and Systems, Boston, MA, IEEE, 1994.
P. Rangan, H. Vin, and S. Ramanathan, “Designing an on-demand multimedia service,” IEEE Communication Magazine, vol. 30, pp. 56–65, 1992.
J. Gemmell, “Multimedia Network File Servers:Multi-Channel Delay Sensitive Data Retrieval,” Proc. of 1st ACM Multimedia Conf. ACM, 1993.
S. Ghandeharizadeh, S. Kim, and C. Shahabi, “Continuous Display of Video OBjects Using Multi-Zoned Disks,” Technical report, University of Southern California, 1995.
R. V. Meter, “Observing the Effects of Multi-Zone Disks,” presented at Usenix Technical Conference, San Jose, CA, USA, 1997.
R. Tewari, “Placement of Multimedia Blocks on Zoned Disks,” presented at IS&T/SPIE Conference on Multimedia Computing and Networking(MMCN), San Jose, CA, USA, 1996.
P. K. C. Tse and C. H. C. Leung, “Improving Multimedia Systems Performance,” ACM Multimedia Systems Journal, vol. 8, pp. 47–55, 2000.
A. Neogi, A. Raniwala, and T.-c. Chiueh, “Phoenix: A Low-Power Fault-Tolerant Realtime Network-Attached Storage Device,” presented at ACM Multimedia, Orlando, FL, USA, 1999.
Y. Won and J. Srivastava, “SMDP: Minimizing buffer requirements for continuous media servers,” ACM/Springer Multimedia Systems Journal, vol. 8, pp. 105–117, 2000.
A. L. N. Reddy and J. C. Wyllie, “I/O Issues in a Multimedia Systems,” in IEEE Computer Magazine, 1994.
R. Rejaie, M. Handley, and D. Estrin, “Layered Quality Adaptation for Internet Video Streaming,” IEEE Journal on Selected Areas of Communications, 2000.
M.-S. Chen, D. D. Kandlur, and P. S. Yu, “Optimization of the grouped sweeping scheduling(gss) with heterogeneous multimedia streams,” ACM Multimedia’ 93, pp. 235–242, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Won, Y., Cho, K. (2002). Adaptive Cycle Extension in Multimedia Document Retrieval. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds) XML-Based Data Management and Multimedia Engineering — EDBT 2002 Workshops. EDBT 2002. Lecture Notes in Computer Science, vol 2490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36128-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-36128-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00130-0
Online ISBN: 978-3-540-36128-2
eBook Packages: Springer Book Archive