6533b838fe1ef96bd12a3ad7
RESEARCH PRODUCT
SYSTOLIC GENERATION OF k-ARY TREES
Vincent VajnovszkiChris Phillipssubject
Hardware and ArchitectureShared memory multiprocessorProcessor modelWeight-balanced treeParallel algorithmParallel computingInversion tableSoftwareTheoretical Computer ScienceLinear arrayMathematicsVector processordescription
The only parallel generating algorithms for k-ary trees are those of Akl and Stojmenović in 1996 and of Vajnovszki and Phillips in 1997. In the first of them, trees are represented by an inversion table and the processor model is a linear aray multicomputer. In the second, trees are represented by bitstrings and the algorithm executes on a shared memory multiprocessor. In this paper we give a parallel generating algorithm for k-ary trees represented by generalized P–sequences for execution on a linear array multicomputer.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1999-03-01 | Parallel Processing Letters |