tReeSearch @ NECST

Gabriele TermignoneDavide Sampietro

Hardware acceleration for string matching problems

Problems for string matching

We want to solve string matching problems.It is pretty intuitive and recurrent in everyday

life

TEXTPATTERN

Usual solution: preprocess the single pattern (e.g. Boyer-Moore or Knuth-Pratt-Morris)INFEASIBL

E

2

Query pool

Query pool

Our approach

Preprocessing RepresentationHost

HW implementation

DatasetResults

FPGAQuery pool

Dataset Processing

3

Our solution: FPGAs

FPGAs allow to overcome the limits of many-core architecture, enhacing performance and parallelism

while constraining costs

4

Executiontime

Number of cores5 20

Saturation

Possible application domains

5

Thank you!

Follow us!Facebook: https://www.facebook.com/tReeSearchNECST

Twitter:https://twitter.com/tReeSearchNECST

Slideshare:https://www.slideshare.net/tReeSearchgabriele.termignone@mail.polimi.itdavide.sampietro@mail.polimi.it

6