Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
- 1 May 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (5) , 496-503
- https://doi.org/10.1109/tc.1976.1674637
Abstract
The shuffle-exchange network is considered as an interconnection network between processors and memory modules in an array computer. Lawrie showed that this network can be used to perform some important permutations in log2 N steps. This work is extended and a network is proposed that permits the realization of any permutation in 0([mi][/mi]N) shuffle-exchange steps. Additional modifications to the basic. procedure are presented that can be applied to perform efficiently some permutations that were not realizable with the original mechanism. Finally, an efficient procedure is described for the realization of a shuffle permutation of N elements on an array computer with M memory modules where M < N.Keywords
This publication has 7 references indexed in Scilit:
- Dynamic Memories with Enhanced Data AccessIEEE Transactions on Computers, 1972
- The Organization and Use of Parallel MemoriesIEEE Transactions on Computers, 1971
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- The ILLIAC IV ComputerIEEE Transactions on Computers, 1968
- ILLIAC IV Software and Application ProgrammingIEEE Transactions on Computers, 1968
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968
- Permutations by Cutting and ShufflingSIAM Review, 1961