A method for analyzing combinatorial properties of static connecting topologies
The mathematical method which allows examining the possibility of a conflict — free realization of a given permutation by a static interconnection network has been developed. The method is based on the use of the congruence notion of the number theory. The method was used to examine the possibility of a conflict-free realization of such well-known permutations as perfect shuffle, cyclic shift, bit reversal and flip permutation by a binary hypercube and by a two-dimensional mesh with the use of common routing algorithms. Moreover a hypercube combinatorial properties were explored under two modes of the same routing algorithm: synchronous and asynchronous. It was shown that using of an asynchronous mode of routing in a hypercube enhances its permutation capabilities.
Unable to display preview. Download preview PDF.
- 1.Lawrie, D.: Access and alingment of data in an array processor. IEEE Trans. on Computers. Vol. C-24 (1975) 12 1145–1155Google Scholar
- 2.Lenfant, J.: A versatile mechanism to move data in an array processor. IEEE Trans. on Computers. Vol. C-34 (1985) 6 506–522Google Scholar
- 3.Orcutt, S.: Implementation of permutation functions in Illiac IV-type computers. IEEE Trans. on Computers. Vol. C-25 (1976)9 929–935Google Scholar
- 4.Padmanabhan, K.: Cube structures for multiprocessors. Commun. of the ACM. Vol. 33 (1990) 45–52Google Scholar
- 5.Rattner, J.: The new age of supercomputing. Lecture Notes in Computer Science. (1991) 487 1–6Google Scholar