Speeding-up exact and fast FIFO-based cache configuration simulation

Masashi Tawada*, Masao Yanagisawa, Nozomu Togawa


研究成果: Article査読

3 被引用数 (Scopus)


The number of sets, block size, and associativity determine processor's cache configurations. Particularly in embedded systems, their cache configuration can be optimized since their target applications are much limited. Recently, the CRCB method has been proposed for LRU-based (Least Recently Used-based) cache configuration simulation, which can calculate cache hit/miss counts accurately and very fast changing the three parameters. However many recent processors use FIFO-based (First-In-First-Out-based) caches instead of LRU-based caches due to the viewpoints of their hardware costs. In this paper, we propose a speeding-up cache configuration simulation method for embedded applications that uses FIFO as a cache replacement policy. We first prove several properties for FIFO-based caches and then propose a simulation method that can process two or more FIFO-based cache configurations with different cache associativities simultaneously. Experimental results show that our proposed method can obtain accurate cache hits/misses and runs up to 32% faster than the conventional simulators.

ジャーナルieice electronics express
出版ステータスPublished - 2011

ASJC Scopus subject areas

  • 電子材料、光学材料、および磁性材料
  • 凝縮系物理学
  • 電子工学および電気工学


「Speeding-up exact and fast FIFO-based cache configuration simulation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。