Abstract
In a video server, a good buffer management scheme can reduce the number of disk I/O. Traditional buffer replacement algorithms such as LRU (least recently used) and MRU (most recently used) only aim at increasing buffer hit ratio, can not guarantee the continuous and real-time needs for continuous media. Interval-based caching scheme can efficiently support cache share, which is a good candidate for video server cache management. In this paper, we propose a new interval-based caching scheme PISR (adaptive dynamic Preemptive Interval-based caching with Size and Rate), which can fit for heterogeneity environments. Our scheme is proven to outperform the original PIS (preemptive interval-based caching with size) and PIR (preemptive interval-based caching with rate) by simulation and performance evaluation.
This paper is supported by National 863 Hi-Tech R&D project under grant No. 2002AA1Z2102.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andronache, V., Sha, E.H.-M., Passos, N.: Design of efficient application-specific page replacement techniques for distributed memory systems. In: Proceedings of 2000 Conference on Parallel and Distributed Computing and Systems, IASTED, pp. 551–556. ACTA Press (2000)
Arlitt, M.F., Williamson, C.L.: Internet web server: workload characterization and performance implications. IEEE/ACM Transactions on Networking 5(5), 631–645 (1997)
Brooks, B.: Quantitative analysis in the humanities: the advantage of ranking techniques. Studies on Zipf’s Law, pp. 65–115 (1982)
Choi, J., Lee, D., Noh, S.H.: Characterization and automatic detection of block reference patterns. Journal of KISS (A) (Computer Systems and Theory) 26(9), 1083–1095 (1999)
Dan, A., Sitaram, D.: A generalized interval caching policy for mixed interactive and long video workloads. In: Proceedings of the SPIE Multimedia Computing and Networking 1996, SPIE, pp. 344–351 (1996)
Kim, J.M., Choi, J., Kim, J.: A low-overhead, high-performance unified buffer management scheme that exploits sequential and looping reference. In: Proceedings of 4th Symposium on Operating Systems Design and Implementation (OSDI 2000), USENIX Assoc., pp.119–134 (2000)
Kimbrel, T., Tomkins, A., Patterson, R.H., Bershad, B., Cao, P., Felten, E.W., Gibson, G.A., Karlin, A.R., Li, K.: A trace-driven comparison of algorithms for parallel prefetching and caching. In: Proceedings of Second USENIX Symposium on Operating Systems Design and Implementation (OSDI), Operating System Review. Special Issue, vol. 30, pp. 19–34 (1996)
Ko, J.-S., Lee, J.-W., Yeom, H.-Y.: An alternative scheme to LRU for efficient page replacement. Journal of KISS (A) (Computer Systems and Theory) 23(5), 478–486 (1996)
Lee, D., Noh, S.H., Sang, L.M.: LRFU: a block replacement policy that exploits infinite history of references. Journal of KISS (A) (Computer Systems and Theory) 24(7), 632–641 (1997)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: An optimality proof of the LRU-K page replacement algorithm. Journal of the ACM 46(1), 92–112 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Q., Jin, H., Li, Y., Li, S. (2004). Adaptive Interval-Based Caching Management Scheme for Cluster Video Server. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24709-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22056-5
Online ISBN: 978-3-540-24709-8
eBook Packages: Springer Book Archive