In this paper we describe an algorithm to route the class of linear complement permutations on Hy percube SIMD computers The class of linear complement permutations are extremely useful in de vising storage schemes for parallel array access The proposed algorithm is self routing and minimal that is the path established by the algorithm between each pair of source and destination processors is v...

In a routing problem, a set of packets must be routed from their sources to their destinations along specified paths in a connected network. Given paths with congestion C and dilation D a lower bound on the routing time is Ω(C + D). The celebrated result of Leighton, Maggs and Rao (1988) established, non-constructively, the existence of a routing schedule which uses constant size buffers and ro...