Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks (Q1117906)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks |
scientific article |
Statements
Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks (English)
0 references
1989
0 references
In this paper we study topological properties of multistage interconnection networks. We define the interconnection scheme between two stages as a pair of functions (f,g) which associate with a cell or node x, labelled as a binary string, his two sons f(x) and g(x). We consider a class of connections called independent connections. Using our graph characterization of networks topologically equivalent to the Baseline network, we show that all the Banyan networks built with independent connections are isomorphic. Finally, we show that if the interconnection scheme is defined by using permutations on the links induced by a permutation of the index digit (PIPID permutation) then the connection is independent. As these PIPID are associated with a very simple bit directed routing, they are used to define most of the networks introduced in the literature. Therefore all these networks are easily shown to be equivalent.
0 references
multistage interconnection networks
0 references
interconnection scheme
0 references
independent connections
0 references
graph characterization of networks
0 references
Baseline network
0 references
Banyan networks
0 references
PIPID permutation
0 references