Abstract
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 language | English |
---|---|
Pages (from-to) | 88-95 |
Number of pages | 8 |
Journal | Conference Proceedings - Annual Symposium on Computer Architecture |
Issue number | 16 |
DOIs | |
State | Published - 1989 |
Externally published | Yes |
Event | 16th Annual International Symposium on Computer Architecture - Jerusalem, Israel Duration: 28 May 1989 → 1 Jun 1989 |
ASJC Scopus subject areas
- General Engineering