2-D SIMD algorithms in the perfect shuffle networks.

Yosi Ben-Asher; David Egozi; Assaf Schuster

doi:10.1145/74925.74936

2-D SIMD algorithms in the perfect shuffle networks.

Yosi Ben-Asher
, David Egozi
, Assaf Schuster

Research output: Contribution to journal › Conference article › peer-review

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	https://doi.org/10.1145/74925.74936
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

Access to Document

10.1145/74925.74936

Cite this

@article{60d440bbe9324194b7e1a194c8094c3c,

title = "2-D SIMD algorithms in the perfect shuffle networks.",

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

author = "Yosi Ben-Asher and David Egozi and Assaf Schuster",

year = "1989",

doi = "10.1145/74925.74936",

language = "English",

pages = "88--95",

journal = "Conference Proceedings - Annual Symposium on Computer Architecture",

issn = "0149-7111",

number = "16",

note = "16th Annual International Symposium on Computer Architecture ; Conference date: 28-05-1989 Through 01-06-1989",

}

TY - JOUR

T1 - 2-D SIMD algorithms in the perfect shuffle networks.

AU - Ben-Asher, Yosi

AU - Egozi, David

AU - Schuster, Assaf

PY - 1989

Y1 - 1989

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

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

UR - https://www.scopus.com/pages/publications/0024666937

U2 - 10.1145/74925.74936

DO - 10.1145/74925.74936

M3 - Conference article

AN - SCOPUS:0024666937

SN - 0149-7111

SP - 88

EP - 95

JO - Conference Proceedings - Annual Symposium on Computer Architecture

JF - Conference Proceedings - Annual Symposium on Computer Architecture

IS - 16

T2 - 16th Annual International Symposium on Computer Architecture

Y2 - 28 May 1989 through 1 June 1989

ER -

2-D SIMD algorithms in the perfect shuffle networks.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this