Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays

DOI10.1016/0167-8191(89)90065-3zbMath0681.68029OpenAlexW2078078534MaRDI QIDQ1823660

Binay Sugla, David A. Carlson

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90065-3

zbMATH Keywords

systolic arraysparallelgraph representationcube-connected cyclesprocessinglinear recurrence systemsshuffle-exchangetree computations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Theory of operating systems (68N25)

Related Items (3)

Parallel newton interpolation on mesh-of-unshuffle network ⋮ Limited width parallel prefix circuits ⋮ A three-phase parallel algorithm for solving linear recurrences

This page was built for publication: Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays