Routing Algorithms for Cellular Interconnection Arrays
- 1 October 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (10) , 939-942
- https://doi.org/10.1109/TC.1984.1676359
Abstract
The paper describes an algebraic model which provides a means for realizing an arbitrary permutation through various cellular-array-type networks. The model views a cellular array as an ordered set of transposition maps where each transposition corresponds to a permutation cell of the array. A permutation realizable by such an array is then expressed as a composition of the transpositions where the rules for the composition are determined by the topology of the array.Keywords
This publication has 6 references indexed in Scilit:
- The Reverse-Exchange Interconnection NetworkIEEE Transactions on Computers, 1980
- On a Class of Multistage Interconnection NetworksIEEE Transactions on Computers, 1980
- Interconnection Networks from Three State CellsIEEE Transactions on Computers, 1977
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- Cellular Interconnection ArraysIEEE Transactions on Computers, 1968