DOE OSTI · 964624
Fast String Search on Multicore Processors: Mapping fundamental algorithms onto parallel hardware
Abstract
String searching is one of these basic algorithms. It has a host of applications, including search engines, network intrusion detection, virus scanners, spam filters, and DNA analysis, among others. The Cell processor, with its multiple cores, promises to speed-up string searching a lot. In this article, we show how we mapped string searching efficiently on the Cell. We present two implementations: • The fast implementation supports a small dictionary size (approximately 100 patterns) and provides a throughput of 40 Gbps, which is 100 times faster than reference implementations on x86 architectures. • The heavy-duty implementation is slower (3.3-4.3 Gbps), but supports dictionaries with tens of thousands of strings.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Scarpazza, Daniele P, Villa, Oreste, Petrini, Fabrizio. 2008-04-01. Fast String Search on Multicore Processors: Mapping fundamental algorithms onto parallel hardware. https://searchnasa.com/record/osti%3A964624/fast-string-search-on-multicore-processors-mapping-fundamental-algorithms-onto-parallel-hardware
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.