Journal of the Korea Society for Simulation (한국시뮬레이션학회논문지)

The Korea Society for Simulation (한국시뮬레이션학회)
권호 표지

Dynamic Cache Partitioning Strategy for Efficient Buffer Cache Management

효율적인 버퍼 캐시 관리를 위한 동적 캐시 분할 블록교체 기법

  • 진재선 (성균관대학교 정보통신공학부) ;
  • 허의남 (서울여자대학교 컴퓨터공학과) ;
  • 추현승 (성균관대학교 정보통신공학부)
  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

The effectiveness of buffer cache replacement algorithms is critical to the performance of I/O systems. In this paper, we propose the degree of inter-reference gap (DIG) based block replacement scheme that retains merits of the least recently used (LRU) such as simple implementation and good cache hit ratio (CHR) for general patterns of references, and improves CHR further. In the proposed scheme, cache blocks with low DIGs are distinguished from blocks with high DIGs and the replacement block is selected among high DIGs blocks as done in the low inter-reference recency set (LIRS) scheme. Thus, by having the effect of the partitioning the cache memory dynamically based on DIGs, CHR is improved. Trace-driven simulation is employed to verified the superiority of the DIG based scheme and shows that the performance improves up to about 175% compared to the LRU scheme and 3% compared to the LIRS scheme for the same traces.

Keywords

References

  1. Proceedings of the USENIX Summer 1994 Technical Conference Application-Controlled File Caching Policies P.Cao;E.W.Felten;K.Li
  2. Proceedings of the 15th Symposium on Operating System Principles Informed Prefetching and Caching R.H.Patterson;G.A.Gibson;E.Ginting;D.Stodolsky;J.Zelenka
  3. Proceedings of the 1993 ACM SIGMOD Conference The LRU-K Page Replacement Algorithm for Database Disk Buffering E.J.O'Neil;P.E.O'Neil;G.Weikum
  4. Proceedings of the 20th International Conference onVLDB 2Q:A Low Overhead High Performance Buffer Management Replacement Algorithm T.Johnson;D.Shasha
  5. Proceeding of 1999 ACM SIGMETRICS Conference on Measuring and Modeling of Computer Systems On the Existence of a Spectrum of Policies that Subsumes he Least Recently Used(LRU) and Least Frequently Used(LFU) Policies D.Lee;J.Choi;J.Kim;S.H.Noh;S.L.Min;Y.Cho;C.S.Kim
  6. ACM SIGMETRICS CONFERENCE ON mEASUREMENT AND Modeling of Computer Systems LIRS:An Effcient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance Song Jiang;Xiaodong Zhang
  7. Proceeding of 1997 ACM SIGMETRICS Conference on Measuring and Modeling of Computer Systems Adaptive Page Replacement Based on Memory Reference Behavior G.Glass;P.Cao
  8. Proceed-ing of 1999 ACM SIGMETRICS Conference on Measuring and Modeling of Computer Systems EELRU:Simple and Effective Adaptive Page Replacement Y.Smaragdakis;S.Kaplan;P.Wilson
  9. Proceedings of the 1999 USENIX ANNUAL tECHNICAL cONFERENCE An Implementation Study of a Detection-Based Adaptive Block Replacement Scheme Jongmoo Choi;SamH. Noh;SangLyul Min;Yookun cho
  10. Proceedings of the 4th USENIX Symposium on Operating System Design and Implementation A Low-Overhead, High-Performance Unified Buffer Management Scheme that Exploits Sequential and Looping References J.M.Kim;J.Choi;J.Kim;S.H.Noh;S.L.Min;Y.Cho;C.S.Kim