본문 바로가기
  • Home

Cache Memory and Replacement Algorithm Implementation and Performance Comparison

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2020, 25(3), pp.11-17
  • DOI : 10.9708/jksci.2020.25.03.011
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : March 5, 2020
  • Accepted : March 26, 2020
  • Published : March 31, 2020

Na-Eun Park 1 Jong Wan Kim 2 Jeong,Tae-Seog 2

1성신여자대학교
2삼육대학교

Accredited

ABSTRACT

In this paper, we propose practical results for cache replacement policy by measuring cache hit and search time for each replacement algorithm through cache simulation. Thus, the structure of each cache memory and the four types of alternative policies of FIFO, LFU, LRU and Random were implemented in software to analyze the characteristics of each technique. The paper experiment showed that the LRU algorithm showed hit rate and search time of 36.044% and 577.936ns in uniform distribution, 45.636% and 504.692ns in deflection distribution, while the FIFO algorithm showed similar performance to the LRU algorithm at 36.078% and 554.772ns in even distribution and 45.662% and 489.574ns in bias distribution. Then LFU followed, Random algorithm was measured at 30.042% and 622.866ns at even distribution, 36.36% at deflection distribution and 553.878ns at lowest performance. The LRU replacement method commonly used in cache memory has the complexity of implementation, but it is the most efficient alternative to conventional alternative algorithms, indicating that it is a reasonable alternative method considering the reference information of data.

Citation status

* References for papers published after 2022 are currently being built.

This paper was written with support from the National Research Foundation of Korea.