Skip to main navigation Skip to search Skip to main content

Matrix-based parallel pattern matching method

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This study presents pattern matching algorithms, based on vector and matrix models that are suitable for parallel pattern matching. On these two models, we further proposed the vector-based single-pattern matching (VBSP) and the matrix-based multi-pattern matching (MBMP) algorithms, as well as the matrix-based multi-pattern approximate (MBMPA) algorithm and the matrix-based multi-pattern exact (MBMPE) algorithm. The G-MBMP algorithm refers to the implementation of the MBMP algorithm on a graphics processing unit (GPU). The performance of the G-MBMPA is better than that of the G-impMASM. The performance of the G-MBMPE is better than that of the G-WM (GPU-based WM algorithm) and that of the G-AC algorithms (GPU-based AC algorithm). The memory of the G-MBMPE algorithm is the least of the three algorithms and is significantly less than that of the G-AC algorithm.

Original languageEnglish
Title of host publication2015 IEEE International Conference on Communications, ICC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7114-7119
Number of pages6
ISBN (Electronic)9781467364324
DOIs
StatePublished - 9 Sep 2015
Externally publishedYes
EventIEEE International Conference on Communications, ICC 2015 - London, United Kingdom
Duration: 8 Jun 201512 Jun 2015

Publication series

NameIEEE International Conference on Communications
Volume2015-September
ISSN (Print)1550-3607

Conference

ConferenceIEEE International Conference on Communications, ICC 2015
Country/TerritoryUnited Kingdom
CityLondon
Period8/06/1512/06/15

Keywords

  • G-MAMP
  • GPU
  • matrix
  • parallel pattern matching

Fingerprint

Dive into the research topics of 'Matrix-based parallel pattern matching method'. Together they form a unique fingerprint.

Cite this