Optimal tree contraction and term matching on the hypercube and related networks:

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Mayr, Ernst W. 1950- (Author), Werchner, Ralph (Author)
Format: Book
Language:German
Published: München 1995
Series:Technische Universität <München>: TUM-I 9532
Subjects:
Summary: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([n/p] 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."
Item Description:Literaturverz. S. 15 - 19
Physical Description:17 S. graph. Darst.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!