Fault Detection of Bloom Filters for Defect Maps
Authors:
- Jae-Young ChoiJCJae-Young Choi
- Yoon-Hwa ChoiYCYoon-Hwa Choi
- 1 October 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15505774,p. 229-235
Abstract
Bloom filters can be used as a data structure for defect maps in nanoscale memory. Unlike most other applications of Bloom filters, both false positive and false negative induced by a fault cause a fatal error in the memory system. In this paper, we present a technique for detecting faults in Bloom filters for defect maps. Spare hashing units and a simple coding technique for bit vectors are employed to detect faults during normal operation. Parallel write/read is also proposed to detect faults with high probability even without spare hashing units.Keywords
This publication has 9 references indexed in Scilit:
- A Defect-Tolerant Molecular-Based Memory Architecture2007
- Afterlife for silicon: CMOL circuit architectures2005
- Deep packet inspection using parallel bloom filtersIEEE Micro, 2004
- Network Applications of Bloom Filters: A SurveyInternet Mathematics, 2004
- CMOS/nano Co-design for crossbar-based molecular electronic systemsIEEE Transactions on Nanotechnology, 2003
- The CMOS/nano interface from a circuits perspective2003
- Nanoscale molecular-switch crossbar circuitsNanotechnology, 2003
- Efficient hardware hashing functions for high performance computersIEEE Transactions on Computers, 1997
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970