This paper studies how to concurrently permute related logical or physical submeshes in a d-dimensional n ×...× n physical mesh via wormhole and dimension-ordered routing. Our objective is to minimize the congestion for realizing the permutations, while maximizing the number and dimensionality of permuted submeshes. We show that for d ≤ 2α + β, concurrent independent permutations of nβ related physical submeshes, each of α dimensions, can be performed in two routing steps without congestion. If the permuted submeshes are logical ones, they can be permuted in one, instead of two, routing step. In addition, any shift operation along any axis of the logical mesh can be performed in the physical mesh without congestion. We also show that if all nodes know the permutation function, any permutation within a submesh of dimensions [2(d--1)/3] can be realized in three routing steps without congestion.
|Original language||English (US)|
|Number of pages||7|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|State||Published - Dec 1 1994|
|Event||Proceeedings of the 6th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA|
Duration: Oct 26 1994 → Oct 29 1994
ASJC Scopus subject areas