Accelerating Real-Time String Searching with Multicore Processors
Computer2008Vol. 41(4), pp. 42–50
Citations Over TimeTop 10% of 2008 papers
Abstract
String searching is at the core of tools used to search, filter, and protect data, but this has become increasingly difficult to do in real time as communication speed grows. The authors present an optimization strategy for a popular algorithm that fully exploits the IBM cell broadband engine architecture to perform exact string matching against large dictionaries and also offer various solutions to alleviate memory congestion.
Related Papers
- → An optimal Bloom filter replacement(2005)150 cited
- → Bloom tree: A search tree based on Bloom filters for multiple-set membership testing(2014)33 cited
- → The Gaussian Bloom Filter(2015)1 cited
- → Balanced counting Bloom filters: a space-efficient synoptic data structure for a high-performance network(2012)3 cited
- → A Bloom Filter Survey: Variants for Different Domain Applications(2021)6 cited