SC Conference - Activity Details

Fabrizio Petrini  (IBM T.J. Watson Research Center)

Virat Agarwal  (IBM T.J. Watson Research Center)

Davide Pasetto  (IBM Corporation)

Acceleration

Wednesday,  02:00PM - 02:30PM

Room PB255

In this paper we present SCAMPI, a ground-breaking string searching algorithm that is fast, space-efficient, scalable and resilient to attacks. SCAMPI is designed with a memory-centric model of complexity in mind, to minimize memory traffic and enhance data reuse with a careful compile-time data layout. The experimental evaluation executed on two families of multicore processors, Cell B.E and Intel Xeon E5472, shows that it is possible to obtain a processing rate of more than 2 Gbits/sec per core with very large dictionaries and heavy hitting rates. In the largest tested configuration, SCAMPI reaches 16 Gbits/sec on 8 Xeon cores, reaching, and in some cases exceeding, the performance of special-purpose processors and FPGA. Using SCAMPI we have been able to scan an input stream using a dictionary of 3.5 millions keywords at a rate of more than 1.2 Gbits/sec per processing core.

The full paper can be found in the ACM Digital Library and IEEE Computer Society