List Ranking and Graph Algorithms on the Reconfigurable Multiple Bus Machine

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.