Skip to main content
Presentation
An Efficient Parallel Algorithm for Term Matching
Lecture Notes in Computer Science
  • Rakesh M. Verma
  • Krishnaprasad Thirunarayan, Wright State University - Main Campus
  • I. V. Ramakrishnan
Document Type
Conference Proceeding
Publication Date
12-1-1986
Abstract

Term matching is a compute-intensive problem that often arises in symbolic manipulation systems like term rewriting, and in functional and equational programming. A parallel algorithm for term matching on the CREW PRAM model was recently described by Dwork, Kanellakis and Stockmeyer. This algorithm requires O(n 2) processors and takes either O(logn) or O(log2 n) time. In this paper we describe a new parallel algorithm that performs term matching in O(log2 n) time using O(n) processors. In our algorithm, we represent the two terms as labeled directed trees. We then construct equivalence classes of nodes in these two trees such that two nodes are in the same class iff they have the same sequence of edge-labels on the path to their respective roots. This is the basis of our parallel algorithm for term matching.

Comments

Presented at the Sixth Foundations of Software Technology and Theoretical Computer Science Conference, New Delhi, India, December 18-20, 1986.

DOI
10.1007/3-540-17179-7_31
Citation Information
Rakesh M. Verma, Krishnaprasad Thirunarayan and I. V. Ramakrishnan. "An Efficient Parallel Algorithm for Term Matching" Lecture Notes in Computer Science Vol. 241 (1986) p. 504 - 518 ISSN: 9783540171799
Available at: http://works.bepress.com/tk_prasad/9/