Cascaded Cache Based on Recently Used Order for Latency Optimization for IoT

Juhee Choi; Heemin Park

doi:10.5626/JCSE.2021.15.3.107

주제분류

...

저널정보

Korean Institute of Information Scientists and Engineers
Journal of Computing Science and Engineering 학술저널
Journal of Computing Science and Engineering Vol.15 No.3
2021.9 107 - 114 (8page)
DOI : 10.5626/JCSE.2021.15.3.107

저자정보

Juhee Choi (Sangmyung University)
Heemin Park (Sangmyung University)

이용수
내서재: 0

내서재에 추가
되었습니다. 내서재에서
삭제되었습니다.

초록·키워드

오류제보하기

The load-to-use latency of the L1 cache is one of the main factors to determine the performance of low power processors. As the clock frequency competitions become severe even in Internet of Things (IoT) devices, the access cycle to the L1 cache was increased to meet the timing constraints. Because previous studies assumed that every access to the data cache has the same latency, the latencies tend to be longer for higher performance. We propose a latency optimization method that uses a cascaded cache based on a recently used order that has several small banks with various latencies instead of one whole data cache with constant latency. In our cache, each bank contains the cache block according to its recently used order. The experiments show that the performance of our proposal is improved by 23.0%, with a 1.3% reduction in the dynamic energy consumption on average.

#Latency optimization #L1 data cache #Cache replacement policy