Optimal Bpc Permutations On A Cube Connected Simd Computer

David Nassimi; Sartaj Sahni

doi:10.1109/TC.1982.1676004

Optimal Bpc Permutations On A Cube Connected Simd Computer

David Nassimi, Sartaj Sahni

Research output: Contribution to journal › Article › peer-review

64 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	338-341
Number of pages	4
Journal	IEEE Transactions on Computers
Volume	C-31
Issue number	4
DOIs	https://doi.org/10.1109/TC.1982.1676004
State	Published - Apr 1982
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Keywords

BPC permutation
complexity
cube connected SIMD computer

Access to Document

10.1109/TC.1982.1676004

Cite this

@article{621863d070bf42c08afb7e581dcb4edb,

title = "Optimal Bpc Permutations On A Cube Connected Simd Computer",

abstract = "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.",

keywords = "BPC permutation, complexity, cube connected SIMD computer",

author = "David Nassimi and Sartaj Sahni",

year = "1982",

month = apr,

doi = "10.1109/TC.1982.1676004",

language = "English (US)",

volume = "C-31",

pages = "338--341",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "4",

}

TY - JOUR

T1 - Optimal Bpc Permutations On A Cube Connected Simd Computer

AU - Nassimi, David

AU - Sahni, Sartaj

PY - 1982/4

Y1 - 1982/4

N2 - 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.

AB - 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.

KW - BPC permutation

KW - complexity

KW - cube connected SIMD computer

UR - http://www.scopus.com/inward/record.url?scp=0020113545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020113545&partnerID=8YFLogxK

U2 - 10.1109/TC.1982.1676004

DO - 10.1109/TC.1982.1676004

M3 - Article

AN - SCOPUS:0020113545

SN - 0018-9340

VL - C-31

SP - 338

EP - 341

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 4

ER -

Optimal Bpc Permutations On A Cube Connected Simd Computer

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this