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

研究成果: 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.

元の言語English
ページ(範囲)1161-1167
ページ数7
ジャーナルieice electronics express
8
発行部数14
DOI
出版物ステータスPublished - 2011 8 1

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Electrical and Electronic Engineering

フィンガープリント Speeding-up exact and fast FIFO-based cache configuration simulation' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用