论文信息 - Optimal Time Bounds for Parallel Term Matching

Optimal Time Bounds for Parallel Term Matching

Term Matching is a fundamental operation in term rewriting, functional programming and logic programming. Parallel algorithms for this operation have attracted much attention recently. However nontrivial lower bounds for term matching are as yet unknown. In this paper, we obtain lower bounds on parallel time for this problem. We also establish the tightness of our lower bounds for some representations and several models, by giving matching upper bounds with as few processors as possible.

I. V. Ramakrishnan | Rakesh M. Verma

[1] I. V. Ramakrishnan,et al. Term Matching on Parallel Computers , 1989, J. Log. Program..

[2] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.

[3] I. V. Ramakrishnan,et al. Optimal Speedups for Parallel Pattern Matching in Trees , 1987, RTA.

[4] I. V. Ramakrishnan,et al. An Efficient Parallel Algorithm for Term Matching , 1986, FSTTCS.

[5] Cynthia Dwork,et al. Parallel Algorithms for Term Matching , 1986, CADE.

[6] Uzi Vishkin,et al. Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.

[7] Richard Cole,et al. Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8] Uzi Vishkin,et al. Constant Depth Reducibility , 1984, SIAM J. Comput..

[9] I. V. Ramakrishnan,et al. Term Matching on Parallel Computers , 1987, ICALP.

[10] John C. Mitchell,et al. On the Sequential Nature of Unification , 1984, J. Log. Program..

[11] Stephen A. Cook,et al. Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.

[12] Johan Håstad,et al. Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.