An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Architecture of a massively parallel processor
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
A Self-Routing Benes Network and Parallel Permutation Algorithms
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
A Model of SIMD Machines and a Comparison of Various Interconnection Networks
IEEE Transactions on Computers
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Permutations on Illiac IV-Type Networks
IEEE Transactions on Computers
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Routing automorphisms of the hypercube
Information Processing Letters
Graphs partitioning: an optimal MIMD queueless routing for BPC-permutations on hypercubes
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
| Hi-index | 14.98 |
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.