Constant time graph and poset algorithms on the reconfigurable multiple bus machine
Document Type
Conference Proceeding
Publication Date
1-1-1994
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. © 1994 IEEE.
Publication Source (Journal or Book title)
Proceedings of the International Conference on Parallel Processing
Recommended Citation
Trahan, J., Vaidyanathan, R., & Subbaraman, C. (1994). Constant time graph and poset algorithms on the reconfigurable multiple bus machine. Proceedings of the International Conference on Parallel Processing, 3 https://doi.org/10.1109/ICPP.1994.78