### Abstract

Forest matching is a fundamental step in solving various problems defined on terms such as term matching. We describe the first optimal speedup parallel algorithm for solving the forest matching problem. Our algorithm runs in time O(log n) using n log n processors on a CRCW PRAM, given a forest of n nodes as input. We use this algorithm to design the first optimal speedup parallel algorithm for solving the term matching problem. We also extend these algorithms to run on the weaker CREW PRAM with optimal speedup as well. This will involve a simple randomization scheme for simulating concurrent writes through a use of hashing.

Original language | English (US) |
---|---|

Pages (from-to) | 245-264 |

Number of pages | 20 |

Journal | Theoretical Computer Science |

Volume | 93 |

Issue number | 2 |

DOIs | |

State | Published - Feb 17 1992 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics

### Cite this

*Theoretical Computer Science*,

*93*(2), 245-264. https://doi.org/10.1016/0304-3975(92)90332-A

**Optimal parallel algorithms for forest and term matching.** / Kedem, Zvi M.; Palem, Krishna V.

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 93, no. 2, pp. 245-264. https://doi.org/10.1016/0304-3975(92)90332-A

}

TY - JOUR

T1 - Optimal parallel algorithms for forest and term matching

AU - Kedem, Zvi M.

AU - Palem, Krishna V.

PY - 1992/2/17

Y1 - 1992/2/17

N2 - Forest matching is a fundamental step in solving various problems defined on terms such as term matching. We describe the first optimal speedup parallel algorithm for solving the forest matching problem. Our algorithm runs in time O(log n) using n log n processors on a CRCW PRAM, given a forest of n nodes as input. We use this algorithm to design the first optimal speedup parallel algorithm for solving the term matching problem. We also extend these algorithms to run on the weaker CREW PRAM with optimal speedup as well. This will involve a simple randomization scheme for simulating concurrent writes through a use of hashing.

AB - Forest matching is a fundamental step in solving various problems defined on terms such as term matching. We describe the first optimal speedup parallel algorithm for solving the forest matching problem. Our algorithm runs in time O(log n) using n log n processors on a CRCW PRAM, given a forest of n nodes as input. We use this algorithm to design the first optimal speedup parallel algorithm for solving the term matching problem. We also extend these algorithms to run on the weaker CREW PRAM with optimal speedup as well. This will involve a simple randomization scheme for simulating concurrent writes through a use of hashing.

UR - http://www.scopus.com/inward/record.url?scp=0026811790&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026811790&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(92)90332-A

DO - 10.1016/0304-3975(92)90332-A

M3 - Article

AN - SCOPUS:0026811790

VL - 93

SP - 245

EP - 264

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -