Name
Abstract | ||
|---|---|---|
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 operations, which allow these bit-parallel algorithms to run efficiently on a graphics processing unit (... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TPDS.2016.2645222 | IEEE Transactions on Parallel and Distributed Systems |
Keywords | Field | DocType |
Graphics processing units,Approximation algorithms,Throughput,Parallel processing,Instruction sets,Pattern matching,Automata | String searching algorithm,Approximation algorithm,Instruction set,Computer science,CUDA,Parallel computing,Algorithm,Approximate string matching,Throughput,Graphics processing unit,Pattern matching,Distributed computing | Journal |
Volume | Issue | ISSN |
28 | 7 | 1045-9219 |
Citations | PageRank | References |
3 | 0.44 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasuaki Mitani | 1 | 3 | 0.44 |
| Fumihiko Ino | 2 | 317 | 38.63 |
| Kenichi Hagihara | 3 | 528 | 56.94 |