Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks

Algorithmica (New York)

Volumn 18, Issue 3, 1997, Pages 445-460

  Mayr, E W ^a   Werchner, R ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Algebraic tree computation; Formula evaluation; Hypercube; Term matching; Tree contraction

Indexed keywords

EID: 0346339500     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009165     Document Type: Article

References (24)

1. H. Abelson. Lower bounds on information transfer in distributed computations. Journal of the Association for Computing Machinery, 27:384-392, 1980.
2. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10:287-302, 1989.
3. B. Aiello, F. T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 55-64, 1990.
4. R. Brent. The parallel evaluation of general arithmetical expressions. Journal of the Association for Computing Machinery, 21:201-206, 1974.
5. R. Cypher and C. G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. Journal of Computer and System Sciences, 47:501-548, 1993.
6. C. Dwork, P. Kanellakis, and J. C. Mitchell. On the sequential nature of unification. Journal of Logic Programming, 1:35-50, 1984.
7. H. Gazit, G. L. Miller, and S.-H. Teng. Optimal tree contraction in the EREW model. In S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz, editors, Concurrent Computations: Algorithms, Architecture, and Technology, pages 139-156. Plenum, New York, 1988.
8. A. Gibbons and W. Rytter. An optimal parallel algorithms for dynamic expression evaluation and its applications. In Proceedings of the 6th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 453-469, 1986. LNCS 241. Springer-Verlag, Berlin.
9. V. Heun and E. W. Mayr. A new efficient algorithm for embedding an arbitrary binary tree into its optimal hypercube. Journal of Algorithms, 20:375-399, 1996.
10. S. R. Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. In Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, pages 101-110, 1988. LNCS 319. Springer-Verlag, Berlin.
11. S. R. Kosaraju and A. L. Delcher. A tree-partitioning technique with applications to expression evaluation and term matching. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 163-172, 1990.
12. Z. M. Kedem and K. V. Palem. Optimal parallel algorithms for forest and term matching. Theoretical Computer Science, 93:245-264, 1992.
13. F. T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann, Los Altos, CA, 1992.
14. D. E. Muller and F. P. Preparata. Parallel restructuring and evaluation of expressions. Journal of Computer and System Sciences, 44:43-62, 1992.
15. G. Miller and J. Reif. Parallel tree contraction and its application. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 478-489, 1985.
16. E. W. Mayr and R. Werchner. Optimal routing of parentheses on the hypercube. Journal of Parallel and Distributed Computation, 26:181-192, 1995.
17. E. W. Mayr and R. Werchner. Divide-and-conquer algorithms on the hypercube. Theoretical Computer Science, 162:283-296, 1996.
18. D. Nassimi and S. Sahni. Data broadcasting in SIMD computers. IEEE Transactions on Computers, 30:101-107, 1981.
19. D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. Journal of the Association for Computing Machinery, 29:642-667, 1982.
20. G. Pietsch and E. Schömer. Optimal parallel recognition of bracket languages on hypercubes. In Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, pages 434-443, 1991. LNCS 480. Springer-Verlag, Berlin.
21. M. S. Paterson and M. N. Wegman. Linear unification. Journal of Computer and System Sciences, 16:158-167, 1978.
22. J. T. Schwartz. Ultracomputers. ACM Transactions on Programming Languages and Systems, 2:484-521, 1980.
23. E. J. Schwabe. On the computational equivalence of hypercube-derived networks. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 388-397, 1990.
24. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pages 263-277, 1981.