Optimal Bpc Permutations On A Cube Connected Simd Computer

David Nassimi, Sartaj Sahni

Research output: Contribution to journalArticlepeer-review

64 Scopus citations


In this correspondence we develop an algorithm to perform BPC permutations on a cube connected SIMD computer. The class of BPC permutations includes many of the frequently occurring permutations such as matrix transpose, vector reversal, bit shuffle, and perfect shuffle. Our algorithm is shown to be optimal in the sense that it uses the fewest possible number of unit routes to accomplish any BPC permutation.

Original languageEnglish (US)
Pages (from-to)338-341
Number of pages4
JournalIEEE Transactions on Computers
Issue number4
StatePublished - Apr 1982
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


  • BPC permutation
  • complexity
  • cube connected SIMD computer


Dive into the research topics of 'Optimal Bpc Permutations On A Cube Connected Simd Computer'. Together they form a unique fingerprint.

Cite this