Abstract
The audio/video stream retrieves from the storage server depends upon the cache refreshment polices. The replacement policy depends upon the efficiency of handle the cache hit ratio and cache miss ratio at real time. The cache size is limited with compare to the auxiliary memory size, and it is only the fraction of the auxiliary memory. The cache memory maintains two blocks one for the Least Recently Used (LRU) and other for the Least Frequency Used (LFU). The Least Recently Frequency used (LRFU) pages store into the cache memory. Since the size of the cache is limited by using the exponential smoothing parameter, dynamically the cache replaces the page with the smallest hit count from the LRU. The request page from the submitted request stream increment the hit counts for the already listed pages. In this paper, we present the LRFU polices and the impact of that polices for the limited cache size with a huge submitted stream of requests in a very small interval of time.
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.
References
Muntzand, D.D., Honeyman, D.D.: Multi-level Caching in Distributed File Systems-oryour cache ain’t nuthin’ but trash. In: Proceedings of the Usenix Winter Technical Conference (1992)
Zhou, Y., Philbin, J.F.: The multi-queue replacement algorithm for second level buffer caches. In: Proceedings of USENIX Annual Technical Conference, pp. 91–104 (2001)
Gramacy, R.B., Warmuth, M.K., Brandt, S.A., Ari, I.: Adaptive caching by refetching. In: NIPS (2002)
Ari, I., Amer, A., Gramarcy, R., Miller, E., Brandt, S., Long, D.: ACME: Adaptive caching using multiple experts. In: Proceedings of the Work shop on Distributed Data and Structures (WDAS), Carleton Scientific (2002)
Wong, T.M., Wilkes, J.: My cache or yours? Makings to storage more exclusive. In: Proceedings of USENIX Annual Technical Conference, pp. 161–175 (2002)
Hsu, W.W., Smith, A.J., Young, H.C.: The automatic improvement of locality in storage systems. Tech. Rep., Computer Science Division, Univ. California, Berkeley (2001)
Lee, W., Park, S., Sung, B., Park, C.: Improving Adaptive Replacement Cache (ARC) by Reuse Distance. In: 9th USENIX Conference on File and Storage Technologies (FAST 2011) (2011)
Sha, E.H.-M., Chantrapornchai, C.: Optimizing Page Replacement for Multiple – Level Memory Hierarchy
Balamash, A., Krunz, M.: An Overview of Web Caching Replacement Algorithms. IEEE Commun. Surveys & Tutorials 6(2) (2004)
Kanrar, S.: Performance of distributed video on demand system for multirate traffic. Retis, pp. 52–56 (2011)
Kanrar, S.: Analysis and Implementation of the Large Scale Video-on-Demand System. IJAIS 1(2), 41–49 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kanrar, S., Mandal, N.K. (2014). Dynamic Page Replacement at the Cache Memory for the Video on Demand Server. In: Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A. (eds) Advanced Computing, Networking and Informatics- Volume 2. Smart Innovation, Systems and Technologies, vol 28. Springer, Cham. https://doi.org/10.1007/978-3-319-07350-7_51
Download citation
DOI: https://doi.org/10.1007/978-3-319-07350-7_51
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07349-1
Online ISBN: 978-3-319-07350-7
eBook Packages: EngineeringEngineering (R0)