Routing with locality in partitioned-bus meshes

We show that adding partitioned-buses (as opposed to long buses that span an entire row or column) to ordinary meshes can reduce the routing time by approximately one-third for permutation routing with locality. A matching time lower bound is also proved. The result can be generalized to multi-packet routing.published_or_final_versio

A lower bound for permutation routing on two-dimensional bused meshes

We prove a 0.691n lower bound for the permutation routing problem in nxn meshes with row and column buses whose propagation delay is one time unit. For meshes having non-unit-time buses, we use similar arguments to derive some simple lower bounds for the permutation routing problem.link_to_subscribed_fulltex