Title :
Parallel generation of k-ary trees
Author :
Vajnovszki, Vincent ; Phillips, Chris
Author_Institution :
Bourgogne Univ., Dijon, France
fDate :
28 Apr-2 May 1997
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 two papers, trees are represented by an inversion table and the processor model is a linear array multicomputer. In the second paper, trees are represented by bit-strings and the algorithm executes on a shared-memory multiprocessor. In this paper, we present a parallel generating algorithm for k-ary trees represented by P-sequences for execution on a linear array multicomputer
Keywords :
parallel algorithms; sequences; systolic arrays; trees (mathematics); P-sequences; bit-strings; combinatorial objects; inversion table; k-ary tree generation; linear array multicomputer; parallel algorithms; processor model; shared-memory multiprocessor; Computational modeling; Concurrent computing; Delay effects; Parallel algorithms;
Conference_Titel :
High Performance Computing on the Information Superhighway, 1997. HPC Asia '97
Conference_Location :
Seoul
Print_ISBN :
0-8186-7901-8
DOI :
10.1109/HPC.1997.592133
