Constant Time Algorithms for Euler Tour and Tree Operations on CRAP

Authors:
Young Hak Kim;Jik Hyun Chang
Affiliations:
-;-
Venue:
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Year:
1997

Citing 6
Cited 0

The power of reconfiguration

Journal of Parallel and Distributed Computing
Parallel Computations on Reconfigurable Meshes

IEEE Transactions on Computers
Constant-time tree algorithms on reconfigurable meshes on size n × n

Journal of Parallel and Distributed Computing
Designing Efficient Parallel Algorithms on CRAP

IEEE Transactions on Parallel and Distributed Systems
An optimal sorting algorithm on reconfigurable mesh

Journal of Parallel and Distributed Computing
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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