The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2009)
Rome, Italy
May 23, 2009 to May 29, 2009
ISBN: 978-1-4244-3751-1
pp: 1-12
Oreste Villa , High-Performance Computing, Pacific Northwest National Laboratory, USA
Daniel Chavarria-Miranda , High-Performance Computing, Pacific Northwest National Laboratory, USA
Kristyn Maschhoff , Cray, Inc., USA
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of on-line content and the increasing wire speeds push the need for fast, and often real-time, string searching solutions. For these conditions, many software implementations (if not all) targeting conventional cache-based microprocessors do not perform well. They either exhibit overall low performance or exhibit highly variable performance depending on the types of inputs. For this reason, real-time state of the art solutions rely on the use of either custom hardware or Field-Programmable Gate Arrays (FPGAs) at the expense of overall system flexibility and programmability. This paper presents a software based implementation of the Aho-Corasick string searching algorithm on the Cray XMT multithreaded shared memory machine. Our solution relies on the particular features of the XMT architecture and on several algorithmic strategies: it is fast, scalable and its performance is virtually content-independent. On a 128-processor Cray XMT, it reaches a scanning speed of ≈ 28 Gbps with a performance variability below 10%. In the 10 Gbps performance range, variability is below 2.5%. By comparison, an Intel dual-socket, 8-core system running at 2.66 GHz achieves a peak performance which varies from 500 Mbps to 10 Gbps depending on the type of input and dictionary size.
Oreste Villa, Daniel Chavarria-Miranda, Kristyn Maschhoff, "Input-independent, scalable and fast string matching on the Cray XMT", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-12, 2009, doi:10.1109/IPDPS.2009.5161043
93 ms
(Ver 3.3 (11022016))