Parallelizing Exact and Approximate String Matching via Inclusive Scan on a GPU

In this study, to substantially improve the runtimes of exact and approximate string matching algorithms, we propose a tribrid parallel method for bit-parallel algorithms such as the Shift-Or and Wu-Manber algorithms. Our underlying idea is to interpret bit-parallel algorithms as inclusive-scan oper...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 28; H. 7; S. 1989 - 2002
Hauptverfasser:	Mitani, Yasuaki, Ino, Fumihiko, Hagihara, Kenichi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.07.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximate string matching Approximation algorithms Automata bit-parallel algorithm GPU Graphics processing units inclusive scan Instruction sets Operators Parallel processing Pattern matching Reproduction (copying) Segmentation shift-or algorithm String matching Synchronism Throughput Wu-Manber algorithm
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!