DEW: A Fast Level 1 Cache Simulation Approach for Embedded Processors with FIFO Replacement Policy
Mohammad Shihabul Haque, Jorgen Peddersen, Andhi Janapsatya, Sri, Parameswaran

TL;DR
DEW is a novel, fast, and exact simulation method for FIFO cache policies in embedded processors, significantly outperforming traditional simulators like Dinero IV in speed and accuracy.
Contribution
This paper introduces DEW, a new cache simulation approach that efficiently handles FIFO policies and multiple configurations, filling a gap in existing simulation tools.
Findings
DEW operates 8 to 40 times faster than Dinero IV.
DEW achieves comparable accuracy with fewer cache ways.
Applicable to various cache configurations and benchmarks.
Abstract
Increasing the speed of cache simulation to obtain hit/miss rates en- ables performance estimation, cache exploration for embedded sys- tems and energy estimation. Previously, such simulations, particu- larly exact approaches, have been exclusively for caches which uti- lize the least recently used (LRU) replacement policy. In this paper, we propose a new, fast and exact cache simulation method for the First In First Out(FIFO) replacement policy. This method, called DEW, is able to simulate multiple level 1 cache configurations (dif- ferent set sizes, associativities, and block sizes) with FIFO replace- ment policy. DEW utilizes a binomial tree based representation of cache configurations and a novel searching method to speed up sim- ulation over single cache simulators like Dinero IV. Depending on different cache block sizes and benchmark applications, DEW oper- ates around 8 to 40…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
