Reducing energy of virtual cache synonym lookup using bloom filters

Reducing memory reference energy with opportunistic virtual caching

“…Woo et al [37] proposed using bloom filter to hold synonym addresses to save L1 cache lookup energy by allowing lower associativity. Ashok et al [1] proposed compiler directed static speculative address translation and cache access support to save energy.…”

Heterogeneously tagged caches for low-power embedded systems with virtual memory support

“…If virtual addresses only are used to access the cache, the resulting cache is referred to as virtually indexed and virtually tagged. The benefit of this cache architecture is that there is no need for address translation when accessing the cache, which results in fast access time and, even more importantly for embedded processors, low power consumption [Qiu and Dubois 2001;Kim et al 1995;Woo et al 2006]. Virtually indexed and tagged caches, however, exhibit severe drawbacks, namely cache aliasing and synonyms [Cekleov and Dubois 1997;Woo et al 2006].…”

Scavenger: A New Last Level Cache Architecture with Global Block Priority

“…This count or frequency is used to assign a priority value to each missing block. This is a novel application of counting Bloom filters, previously employed for implementing hierarchical store queues [1], coarse-grain coherence [11], snoop filters [12,19], prefetching and data speculation [13], low-energy synonym lookup [20], etc. A low power counting Bloom filter was proposed in [17].…”