Parallel Generation of k-ary Trees

Authors:
Vincent Vajnovszki;Chris Phillips
Affiliations:
-;-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 4
Cited 0

An optimal algorithm for generating equivalence relations on a linear array of processors

BIT
Systolic generation of derangements

Proceedings of the international workshop on Algorithms and parallel VLSI architectures II
An optimal systolic algorithm for generating permutations in lexicographic order

Journal of Parallel and Distributed Computing
Generating t-ary trees in parallel

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The only published algorithms for generating k-ary trees in parallel are those of Akl and Stojmenovic (1996) and Vajnovszki and Phillips (1997). In the first of these papers trees are represented by an inversion table and the processor model is a linear array multicomputer. In the second trees are represented by bitstrings and the algorithm executes on a shared memorymultiprocessor. In this paper we present a parallel generating algorithm for k-ary trees represented by P--sequences for execution on a linear array multicomputer.