Title :
Routing Algorithms for Cellular Interconnection Arrays
Author :
Oruc, A. Yavuz ; Prakash, Deepak
Author_Institution :
Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute
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 :
Cellular interconnection arrays; cycle; interconnection networks; monotone increasing factorization; permutation; transposition; Cellular networks; Compaction; Computer architecture; Computer science; Conferences; Encoding; Microprogramming; Optimizing compilers; Polynomials; Routing; Cellular interconnection arrays; cycle; interconnection networks; monotone increasing factorization; permutation; transposition;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.1676359
