Routing problems on the mesh of buses

Abstract

The mesh of buses (MBUSs) is a parallel computation model which consists of n × n processors, n row buses and n column buses. Upper and lower bounds for the routing problem over MBUSs are discussed. We first show elementary upper and lower hounds, 2n and 0.5n, respectively, for its parallel time complexity. The gap between 2n and 0.5n is then narrowed to 1.5n and n, which is the main theme of the paper. The n lower bound might seem to he trivial but is actually not. Three counter examples will be shown against this kind of easy intuition.