Multithreaded pattern matching algorithm with data rearrangement

Doohwan Oh, Seunghun Kim, Won W. Ro

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This letter proposes a multithreaded pattern matching algorithm which can efficiently distribute the patterns to be searched on multiple threads to achieve rapid pattern matching operation. The proposed idea is designed to fully exploit thread-level parallelism to enhance searching speed. By distributing a large number of patterns over multiple threads, pattern matching procedure experiences less cache misses and shows better performance. In addition, we propose to sort the target patterns according to the alphabetic order to achieve efficient data decomposition. From detailed experiments and performance analysis, our algorithm shows remarkable performance gain compared to the original Wu-Manber algorithm.

Original languageEnglish
Pages (from-to)1520-1526
Number of pages7
Journalieice electronics express
Volume7
Issue number20
DOIs
Publication statusPublished - 2010 Nov 16

Fingerprint

Pattern matching
threads
Decomposition
distributing
Experiments
decomposition

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Electrical and Electronic Engineering

Cite this

Oh, Doohwan ; Kim, Seunghun ; Ro, Won W. / Multithreaded pattern matching algorithm with data rearrangement. In: ieice electronics express. 2010 ; Vol. 7, No. 20. pp. 1520-1526.
@article{6cef629111224d6c89dec5a1bdd304d3,
title = "Multithreaded pattern matching algorithm with data rearrangement",
abstract = "This letter proposes a multithreaded pattern matching algorithm which can efficiently distribute the patterns to be searched on multiple threads to achieve rapid pattern matching operation. The proposed idea is designed to fully exploit thread-level parallelism to enhance searching speed. By distributing a large number of patterns over multiple threads, pattern matching procedure experiences less cache misses and shows better performance. In addition, we propose to sort the target patterns according to the alphabetic order to achieve efficient data decomposition. From detailed experiments and performance analysis, our algorithm shows remarkable performance gain compared to the original Wu-Manber algorithm.",
author = "Doohwan Oh and Seunghun Kim and Ro, {Won W.}",
year = "2010",
month = "11",
day = "16",
doi = "10.1587/elex.7.1520",
language = "English",
volume = "7",
pages = "1520--1526",
journal = "IEICE Electronics Express",
issn = "1349-2543",
publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",
number = "20",

}

Multithreaded pattern matching algorithm with data rearrangement. / Oh, Doohwan; Kim, Seunghun; Ro, Won W.

In: ieice electronics express, Vol. 7, No. 20, 16.11.2010, p. 1520-1526.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multithreaded pattern matching algorithm with data rearrangement

AU - Oh, Doohwan

AU - Kim, Seunghun

AU - Ro, Won W.

PY - 2010/11/16

Y1 - 2010/11/16

N2 - This letter proposes a multithreaded pattern matching algorithm which can efficiently distribute the patterns to be searched on multiple threads to achieve rapid pattern matching operation. The proposed idea is designed to fully exploit thread-level parallelism to enhance searching speed. By distributing a large number of patterns over multiple threads, pattern matching procedure experiences less cache misses and shows better performance. In addition, we propose to sort the target patterns according to the alphabetic order to achieve efficient data decomposition. From detailed experiments and performance analysis, our algorithm shows remarkable performance gain compared to the original Wu-Manber algorithm.

AB - This letter proposes a multithreaded pattern matching algorithm which can efficiently distribute the patterns to be searched on multiple threads to achieve rapid pattern matching operation. The proposed idea is designed to fully exploit thread-level parallelism to enhance searching speed. By distributing a large number of patterns over multiple threads, pattern matching procedure experiences less cache misses and shows better performance. In addition, we propose to sort the target patterns according to the alphabetic order to achieve efficient data decomposition. From detailed experiments and performance analysis, our algorithm shows remarkable performance gain compared to the original Wu-Manber algorithm.

UR - http://www.scopus.com/inward/record.url?scp=78149371718&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78149371718&partnerID=8YFLogxK

U2 - 10.1587/elex.7.1520

DO - 10.1587/elex.7.1520

M3 - Article

AN - SCOPUS:78149371718

VL - 7

SP - 1520

EP - 1526

JO - IEICE Electronics Express

JF - IEICE Electronics Express

SN - 1349-2543

IS - 20

ER -