9 search results - page 1 / 2 » A Cache Architecture for Counting Bloom Filters |
ICON
2007
IEEE
13 years 10 months ago
2007
IEEE
— Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, e.g., u...
ISLPED
2009
ACM
13 years 11 months ago
2009
ACM
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...
ARCS
2006
Springer
13 years 8 months ago
2006
Springer
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...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—In this paper, we uncover the Bloom paradox in Bloom filters: sometimes, it is better to disregard the query results of Bloom filters, and in fact not to even query them, thus...
14
Voted
ISLPED
2006
ACM
13 years 10 months ago
2006
ACM
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...