List ranking and graph algorithms on the reconfigurable multiple bus machine
Document Type
Conference Proceeding
Publication Date
1-1-1993
Abstract
The Reconfigurable Multiple Bus Machine (RMBM) is a model of parallel computation based on reconfigurable buses. We present constant time algorithms for list ranking, integer sorting and a number of fundamental graph problems on the RMBM. The algorithms are more efficient in terms of processors than the corresponding PARBS algorithms. The algorithms demonstrate some of the potential for computation available in the ability to manipulate communication paths as a vital part of computation.
Publication Source (Journal or Book title)
Proceedings of the International Conference on Parallel Processing
First Page
244
Last Page
247
Recommended Citation
Subbaraman, C., Trahan, J., & Vaidyanathan, R. (1993). List ranking and graph algorithms on the reconfigurable multiple bus machine. Proceedings of the International Conference on Parallel Processing, 3, 244-247. https://doi.org/10.1109/ICPP.1993.111