NDLI: L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture

Content Provider	IEEE Xplore Digital Library
Author	Elham Safi Moshovos, A. Veneris, A.
Copyright Year	2006
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Toronto Univ., Ont. (Elham Safi; Moshovos, A.; Veneris, A.)
Abstract	We study the energy, latency and area characteristics of two counting bloom filter implementations using full custom layouts in a commercial 0.13mum technology. The first implementation, S-CBF, uses an SRAM array of counts and a shared counter. The second, L-CBF, utilizes an array of up/down linear feedback shift registers. Circuit level simulations demonstrate that for a 1K-entry CBF with a 15-bit count per entry, L-CBF is 3.7 or 1.6 times faster than the S-CBF depending on the operation. The L-CBF requires 2.3 or 1.4 times less energy per operation compared to the S-CBF. However, the L-CBF requires 3.2 times more area. We demonstrate that for one application of CBFs (early hit/miss detection for L1 caches (Peir, 2002) for an aggressive dynamically-scheduled superscalar processor) the energy consumed by the L-CBF is 60% of the energy consumed by the S-CBF for most of the SPEC CPU 2000 benchmarks
Sponsorship	ACM SIGDA IEEE Circuits and Syst. Soc
Starting Page	250
Ending Page	255
File Size	1984765
Page Count	6
File Format	PDF
ISBN	1595934626
DOI	10.1109/LPE.2006.4271845
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-10-04
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Association for Computing Machinery, Inc. (ACM)
Subject Keyword	Filters Delay Testing Linear feedback shift registers Hardware CMOS technology Computer architecture Power engineering and energy Random access memory Counting circuits Energy per Operation Design Measurement Performance Experimentation Counting Bloom Filters Processors
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

L-CBF: a low-power, fast counting bloom filter architecture

L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture

L-CBF: a low-power, fast counting Bloom filter architecture (2006)

L-CBF: a low-power, fast counting Bloom filter architecture (2006)

Area efficient counting bloom filter (a-cbf) design for nids.

Implementing error detection in fast counting Bloom filters

Fibonacci and Galois mode feedback with carry shift registers

A cache architecture for counting bloom filters.

A Memory-Optimized Bloom Filter Using an Additional Hashing Function

L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture

Similar Documents

L-CBF: a low-power, fast counting bloom filter architecture

L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture

L-CBF: a low-power, fast counting Bloom filter architecture (2006)

L-CBF: a low-power, fast counting Bloom filter architecture (2006)

Area efficient counting bloom filter (a-cbf) design for nids.

Implementing error detection in fast counting Bloom filters

Fibonacci and Galois mode feedback with carry shift registers

A cache architecture for counting bloom filters.

A Memory-Optimized Bloom Filter Using an Additional Hashing Function

L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture