Abstract
Various block replacement schemes have been proposed so far to enhance hit ratios by maintaining blocks that will frequently be re-referenced at buffer cache in the future. Especially the LRU block replacement scheme is widely used due to its simplicity and good adaptability to the changes on the working set. However, LRU has a severe drawback that exhibits itself in performance degradation in access patterns with weak locality such as sequential and looping reference. In this paper, we propose an improved LRU buffer cache management scheme using pre-fetching and pre-releasing based on spatial locality. It is as simple as the LRU scheme and retains its characteristics. Trace-driven simulation experiments show that the hit ratios are improved up to about 24% (with the average of 18%) compared to the LRU scheme for the workloads many engineers use.
This paper was supported in part by Brain Korea 21 and University ITRC project. Dr. H. Choo is the corresponding author.
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
Cao, P., Felten, E.W., Li, K.: Application-Controlled File Caching Policies. In: Proceedings of the USENIX Summer 1994 Technical Conference, pp. 171–182 (1994)
Patterson, R.H., Gibson, G.A., Ginting, E., Stodolsky, D., Zelenka, J.: Informed Prefetching and Caching. In: Proceedings of the 15th Symposium on Operating System Principles, pp. 1–16 (1995)
Robinson, J.T., Devarakonda, M.V.: Data Cache Management Using Frequency-Based Replacement. In: Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 134–142 (1990)
Lee, D., Choi, J., Noh, S.H., Min, S.L., Cho, Y., Kim, C.S.: On the Existence of a Spectrum of Policies that Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies. In: Proceedings of the 1999 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 134–143 (1999)
Phalke, V., Gopinath, B.: An Inter-Reference Gap Model for Temporal Locality in Program Behavior. In: Proceedings of the 1995 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 291–300 (1995)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K Page Replacement Algorithm for Database Disk Buffering. In: Proceedings of the 1993 ACM SIGMOD Conference, pp. 297–306 (1993)
Jiang, S., Zhang, X.: LIRS: An Efficient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance. In: Proceedings of the 2002 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 31–42 (2002)
Johnson, T., Shasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: Proceedings of the 20th International Conference on VLDB, pp. 439–450 (1994)
Glass, G., Cao, P.: Adaptive Page Replacement Based on Memory Reference Behavior. In: Proceedings of the 1997 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 115–126 (1997)
Smaragdakis, Y., Kaplan, S., Wilson, P.: ’EELRU: Simple and Effective Adaptive Page Replacement. In: Proceedings of 1999 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, May 1999, pp. 122–133 (1999)
Kim, J.M., Choi, J., Kim, J., Noh, S.H., Min, S.L., Cho, Y., Kim, C.S.: A Low- Overhead High-Performance Unified Buffer Management Scheme that Exploits Sequential and Looping References. In: Proceedings of the 4th USENIX Symposium on Operating System Design and Implementation, October 2000, pp. 119–134 (2000)
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
Ko, Y., Kim, J., Choo, H. (2004). Efficient Pre-fetch and Pre-release Based Buffer Cache Management for Web Applications. 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 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-24707-4_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22054-1
Online ISBN: 978-3-540-24707-4
eBook Packages: Springer Book Archive