Exact and fast L1 cache configuration simulation for embedded systems with FIFO/PLRU cache replacement policies

Masashi Tawada*, Masao Yanagisawa, Tatsuo Ohtsuki, Nozomu Togawa

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Since target applications in embedded systems are limited, we can optimize its cache configuration. A very fast and exact cache simulation algorithm, CRCB, has been recently proposed. CRCB assumes LRU as a cache replacement policy but FIFO- or PLRU-based cache is often used due to its low hardware cost. This paper proposes exact and fast L1 cache simulation algorithms for PLRU- or FIFO-based caches. First, we prove that CRCB can be applied to FIFO and PLRU. Next, we show several properties for FIFO- and PLRU-based caches and propose their associated cache-simulation speed-up algorithms. Experiments demonstrate that our algorithms run up to 300 times faster than a well-known cache simulator.

Original languageEnglish
Title of host publicationProceedings of 2011 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2011
Pages247-250
Number of pages4
DOIs
Publication statusPublished - 2011 Jun 28
Event2011 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2011 - Hsinchu, Taiwan, Province of China
Duration: 2011 Apr 252011 Apr 28

Publication series

NameProceedings of 2011 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2011

Conference

Conference2011 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2011
Country/TerritoryTaiwan, Province of China
CityHsinchu
Period11/4/2511/4/28

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Exact and fast L1 cache configuration simulation for embedded systems with FIFO/PLRU cache replacement policies'. Together they form a unique fingerprint.

Cite this