Skip to main content
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

An optimal tree contraction algorithm for the boolean hypercube and the constant-degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on novel routing techniques and, for certain small subtrees, simulates optimal PRAM algorithms. For trees of size n, stored on a p processor hypercube in in-order, the running time of the algorithm is \(O(\lceil n/p\rceil\log p)\) . The resulting speed-up of \(O(p/\log p)\) is optimal due to logarithmic communication overhead, as shown by a corresponding lower bound. The same algorithmic ingredients can also be used to solve the term matching problem, one of the fundamental problems in logic programming.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received August 10, 1994; revised May 2, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mayr, E., Werchner, R. Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks. Algorithmica 18, 445–460 (1997). https://doi.org/10.1007/PL00009165

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009165

Navigation