Download Answer to some questions regarding interconnection networks

Answer to some questions regarding interconnection networks
1. What is graph isomorphism [1]?
2. What is the channel bisection width for the star network [2]
A cut of a network C(N1,N2) is a set of channels that partition the set of all nodes into
two disjoint sets N1 and N2. Each element of C(N1,N2) is a channel with a source in N1
and destination in N2 or vice versa.
A bisection of a network is a cut that partitions the entire network nearly in half, such that
|N2|≤|N1|≤|N2+1|. Here |N2| means the number of nodes that belong to the partition N2.
The channel bisection of a network is the minimum channel count over all bisections of
the network:
Bc  min | C ( N1, N 2) |
bi sec tions
The bisection width of the star network is
3. Drawing Omega network with 64 inputs that uses 4x4 switches
This network has double less stages than 64 input network that uses 2x2 switches. With
4x4 switches we need 3 stages.
Omega network uses shuffling mechanism for connections. So from one stage to the
other the inputs and outputs will be connected using shuffling:
000000->000000
000001->000010
000010->000100
….
111110->111101
111111->111111
References
1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications.
This textbook is out of print. Students are asked to download their personal copy from
the following web page: http://www.ecp6.jussieu.fr/pageperso/bondy/bondy.html
(follow the link Books and then click on pdf files)
2. W. Dally, B. Towles, Principles and Practices of Interconnection Networks, Morgan
Kaufmann, 2004.