earticle

논문검색

Dynamically Self-adjusting Cache Replacement Algorithm

초록

영어

The concept of caching is a fundamental feature in modern computing architectures and, has no doubt, found wide applications in diverse areas. Performance evaluation of systems is functionally related to how caching is implemented on a given computing platform, a metric influenced by the cache replacement policy. This paper describes an online learning-induced, self-adjusting cache management strategy with low overhead and scan-resistant characteristics that outperforms the LRU replacement algorithm using adaptation to balance between workload frequency and recency patterns.

목차

Abstract
 1. Introduction
 2. Review of Cache Replacement Algorithms
 3. Cache Design Philosophy
  3.1 Dynamically Self-adjusting Cache
 4. Experimental Results and Discussion
 5. Conclusion
 References

저자정보

  • Tola John Odule Department of Mathematical Sciences Olabisi Onabanjo University
  • Idowun Ademola Osinuga Department of Mathematics, University of Agriculture Abeokuta

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.