Derivation of a parallel string matching algorithm

Authors:
Jayadev Misra
Affiliations:
The University of Texas at Austin, Austin, TX
Venue:
Information Processing Letters
Year:
2003

Citing 2
Cited 5

Powerlist: a structure for parallel recursion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Data structures for parallel recursion

Data structures for parallel recursion

Processor Array Architectures for Deep Packet Classification

IEEE Transactions on Parallel and Distributed Systems
Real-Time String Filtering of Large Databases Implemented Via a Combination of Artificial Neural Networks

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Multi-byte Regular Expression Matching with Speculation

RAID '09 Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection
Non-blocking parallel subset construction on shared-memory multicore architectures

AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments

International Journal of Parallel Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [J. Kornerup, PhD Thesis, 1997; J. Misra, ACM Trans. Programming Languages Systems 16 (6) (1994) 1737-1740] is central to the development of the algorithm and its algebraic manipulations.