Sciweavers

9 search results - page 1 / 2
» Reducing energy of virtual cache synonym lookup using bloom ...
Sort
View
CASES
2006
ACM
13 years 10 months ago
Reducing energy of virtual cache synonym lookup using bloom filters
Virtual caches are employed as L1 caches of both high performance and embedded processors to meet their short latency requirements. However, they also introduce the synonym proble...
Dong Hyuk Woo, Mrinmoy Ghosh, Emre Özer, Stua...
ISLPED
2009
ACM
161views Hardware» more  ISLPED 2009»
13 years 11 months ago
Way guard: a segmented counting bloom filter approach to reducing energy for set-associative caches
The design trend of caches in modern processors continues to increase their capacity with higher associativity to cope with large data footprint and take advantage of feature size...
Mrinmoy Ghosh, Emre Özer, Simon Ford, Stuart ...
ISCA
2012
IEEE
333views Hardware» more  ISCA 2012»
11 years 7 months ago
Reducing memory reference energy with opportunistic virtual caching
Most modern cores perform a highly-associative translation look aside buffer (TLB) lookup on every memory access. These designs often hide the TLB lookup latency by overlapping it...
Arkaprava Basu, Mark D. Hill, Michael M. Swift
ARCS
2006
Springer
13 years 8 months ago
Efficient System-on-Chip Energy Management with a Segmented Bloom Filter
As applications tend to grow more complex and use more memory, the demand for cache space increases. Thus embedded processors are inclined to use larger caches. Predicting a miss i...
Mrinmoy Ghosh, Emre Özer, Stuart Biles, Hsien...
TON
2002
175views more  TON 2002»
13 years 4 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher