Realization of permutations on generalized INDRA networks☆
References (20)
- et al.
The extra-stage cube: A fault-tolerant interconnection network for supersystems
IEEE Trans. Comput.
(May 1982) Graph theoretical analysis and design of multistage interconnection networks
IEEE Trans. Comput.
(July 1983)Mathematical Theory of Connecting Networks and Telephone Traffic
(1965)Graphs and Hypergraphs
(1973)- et al.
Connection principles for multipath packet switching networks
A survey of interconnection networks
Computer
(Dec. 1981)- et al.
Generalized delta networks
Access and alignment of data in an array processor
IEEE Trans. Comput.
(Dec. 1975)Parallel permutations of data: A Benes network control algorithm for frequently used permutations
IEEE Trans. Comput.
(July 1978)- et al.
Optimal BPC permutations on a cube connected computer
IEEE Trans. Comput.
(Apr. 1982)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This research is supported by the NSF Presidential Young Investigator Award No. ECS-8452003, an AT&T Grant, and DARPA/ARO Contract No. DAAG 29-84-K-0066. A preliminary version of this paper was presented at the International Conference in Parallel Processing, St. Charles, Ill., August 1985.
- †
This research was performed while the author was at the University of Southern California.
Copyright © 1988 Published by Elsevier Inc.