Abstract
We present an optimal parallel pattern matching algorithm for d-dimensional patterns. Namely, for two d-dimensional arrays A and B, ∣A∣ = md= M, ∣B∣ = nd= N, and k ≤ N/log2m processors, all occurrences of A in B can be found in time dcN/k + log2k on an exclusive read exclusive write (EREW) PRAM, or in time dcN/k on a concurrent read exclusive write (CREW) PRAM. In the CREW algorithm, concurrent read is invoked just once. The main tools are parallel prefix computation and randomization. All previous results in this area [Vishkin, 85; Kedem, Landau, Palem, 89] employed a concurrent read concurrent write (CRCW) PRAM model. As a demonstration of the power of this method, we provide a simple optimally efficient algorithm for the suffix-prefix matching problem of [Kedem, Landau Palem, 89] again for an EREW rather than for a CRCW machine.
| Original language | English |
|---|---|
| Title of host publication | Sequences II |
| Editors | Renato Capocelli, Alfredo De Santis, Ugo Vaccaro |
| Place of Publication | New York, NY |
| Publisher | Springer New York |
| Pages | 292-299 |
| Number of pages | 8 |
| ISBN (Print) | 978-1-4613-9323-8 |
| DOIs | |
| State | Published - 1993 |
Fingerprint
Dive into the research topics of 'Optimal Parallel Pattern Matching Through Randomization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver