Optimal parallel algorithms for forest and term matching

Zvi M. Kedem, Krishna V. Palem

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)245-264
Number of pages20
JournalTheoretical Computer Science
Volume93
Issue number2
DOIs
StatePublished - Feb 17 1992

Fingerprint

Optimal Algorithm
Parallel algorithms
Parallel Algorithms
Speedup
Matching Problem
Term
Hashing
Randomisation
Concurrent
Vertex of a graph

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

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

In: Theoretical Computer Science, Vol. 93, No. 2, 17.02.1992, p. 245-264.

Research output: Contribution to journalArticle

Kedem, Zvi M. ; Palem, Krishna V. / Optimal parallel algorithms for forest and term matching. In: Theoretical Computer Science. 1992 ; Vol. 93, No. 2. pp. 245-264.
@article{5aff20130e1248e88cb5544fffddf721,
title = "Optimal parallel algorithms for forest and term matching",
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.",
author = "Kedem, {Zvi M.} and Palem, {Krishna V.}",
year = "1992",
month = "2",
day = "17",
doi = "10.1016/0304-3975(92)90332-A",
language = "English (US)",
volume = "93",
pages = "245--264",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

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 -