On permutations passable by the Gamma network
Journal Article
·
· J. Parallel Distrib. Comput.; (United States)
An analysis of the permuting capability of the Gamma network with a simple control algorithm was presented in this paper. A simplified and easily implementable routing algorithm was shown to be capable of performing most of the frequently used classes of permutations in parallel processing on the Gamma network. Conditions leading to conflict situations in the network while realizing arbitrary permutations with this algorithm were formulated. In particular, the authors have proved that with this control algorithm, the Gamma network realizes the perfect shuffle, unshuffle, flip permutation, cyclic shifts, shuffle within segments, bit-switch, exchange, and some other classes of permutations. Further research will include techniques to achieve fast and conflict-free rerouting of permutations in the case of individual switch or link failures.
- Research Organization:
- Dept. of Electrical Engineering-Systems, Univ. of Southern California, Los Angeles, CA 90089-0781
- OSTI ID:
- 6778426
- Journal Information:
- J. Parallel Distrib. Comput.; (United States), Journal Name: J. Parallel Distrib. Comput.; (United States) Vol. 3:1; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Permutations on Illiac IV-type networks
A new interconnection network for SIMD computers: The sigma network
Fault-tolerant multiprocessors with redundant-path interconnection networks
Journal Article
·
Tue Jul 01 00:00:00 EDT 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5516693
A new interconnection network for SIMD computers: The sigma network
Journal Article
·
Wed Jul 01 00:00:00 EDT 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5768155
Fault-tolerant multiprocessors with redundant-path interconnection networks
Journal Article
·
Mon Mar 31 23:00:00 EST 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5704786