Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine

Authors:
Jerry L. Trahan;Ramachandran Vaidyanathan;Chittur P. Subbaraman
Affiliations:
Louisiana State University, USA;Louisiana State University, USA;University of California at Irvine, USA
Venue:
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 03
Year:
1994

Citing 0
Cited 1

Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Reconfigurable Multiple Bus Machine (RMBM) is a model of parallel computation based on reconfigurable buses. In this paper, vie present constant time RMBM algorithms for a collection of basic, graph problems that include, lowest common ancestors and Euler tour related problems (for trees) and shortest path and connectivity related problems (for general graphs). We also present results for some poset and lattice problems. All algorithms are at least as efficient or more efficient in terms of processors than corresponding PARBUS algorithms.