Experiences with String Matching on the Fermi Architecture

String matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. In this paper we present an efficient implementation of the Aho-Corasick string matching algorithm on Graphic Processing Units (GPUs), showing how we progress...

Full description

Saved in:
Bibliographic Details
Published inArchitecture of Computing Systems - ARCS 2011 pp. 26 - 37
Main Authors Tumeo, Antonino, Secchi, Simone, Villa, Oreste
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
Graphic Processing Unit
Input Stream
Intrusion Detection System
Shared Memory
String Match
Online AccessGet full text
ISBN3642191363
9783642191367
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-19137-4_3

Cover

More Information
Summary:String matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. In this paper we present an efficient implementation of the Aho-Corasick string matching algorithm on Graphic Processing Units (GPUs), showing how we progressively redesigned the algorithm and the data structures to fit on the architecture. We then evaluate the implementation on single and multiple Tesla C2050 (T20 “Fermi” based) boards, comparing them to the previous Tesla C1060 (T10 based) solutions and equivalent multi-core implementations on x86 CPUs. We discuss the various tradeoffs of the different architectures.
ISBN:3642191363
9783642191367
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-19137-4_3