Title :
Constant time algorithms for Euler tour and tree operations on CRAP
Author :
Kim, Young Hak ; Chang, Jik Hyun
Author_Institution :
Dept. of Comput. Sci., Korea Naval Acad., Kyungnam, South Korea
fDate :
28 Apr-2 May 1997
Abstract :
A cross-bridge reconfigurable array of processors (CRAP) is a parallel processing system which has the ability to change dynamically its interconnection scheme during the execution of an algorithm. In this paper, given an unrooted tree T with n vertices, we propose an O(1) time algorithm for constructing an Euler tour of T on a 2-D (dimensional) n≫MULT(n-1) CRAP. Then, given a root vertex r, we present O(1) time algorithms for tree operations which compute the parent and the preorder/postorder number of each vertex, the number of vertices in the subtree rooted at each vertex, and the level of each vertex
Keywords :
computational complexity; parallel algorithms; parallel architectures; parallel machines; reconfigurable architectures; trees (mathematics); CRAP; Euler tour operations; algorithm execution; constant time algorithms; cross-bridge reconfigurable array of processors; interconnection scheme; parallel processing system; postorder number; preorder number; root vertex; tree operations; unrooted tree; vertices; Computational modeling; Computer science; Parallel processing; Phase change random access memory; Silicon; Switches;
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.592173
