2-D SIMD algorithms in the perfect shuffle networks.

Yosi Ben-Asher, David Egozi, Assaf Schuster

Research output: Contribution to journalConference articlepeer-review


A set of basic algorithms for SIMD (single-instruction multiple-data-stream) perfect shuffle networks is studied. These algorithms were studied previously for the 1-D case, where the size of the problem N is the same as the number of processors P. For the 2-D case of N = L * P, the authors improve several algorithms, achieving run time O(L + log P) as N exceeds P. They give nontrivial algorithms for the following 2-D operations: row reduction, parallel prefix, transpose, smoothing, and Cartesian product.

Original languageEnglish
Pages (from-to)88-95
Number of pages8
JournalConference Proceedings - Annual Symposium on Computer Architecture
Issue number16
StatePublished - 1989
Externally publishedYes
Event16th Annual International Symposium on Computer Architecture - Jerusalem, Israel
Duration: 28 May 19891 Jun 1989

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of '2-D SIMD algorithms in the perfect shuffle networks.'. Together they form a unique fingerprint.

Cite this