Efficient submesh permutations in wormhole-routed meshes

Ching Tien Ho*, Ming Yang Kao

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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 languageEnglish (US)
Pages (from-to)672-678
Number of pages7
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - 1994
EventProceeedings of the 6th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: Oct 26 1994Oct 29 1994

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Efficient submesh permutations in wormhole-routed meshes'. Together they form a unique fingerprint.

Cite this