Comparing direct network topologies [problem 2.11 in textbook]
- You are asked to design a network with 64 nodes using a 3-D
torus, a 6-D binary hypercube, or a CCC with a minimum
diameter. answer the following questions:
- Let d be the node degree, D the network diameter, and L the total
number of links in the network. Also, suppose that the quality of the
network is measured by 1/(d.D.L), rank the three architectures
according to this measure.
- The mean internode distance is defined as the average
number of hops along the shortest path for a message to travel from
one node to another. The average is calculated for all
(source,destination) pairs. Order the three topologies based on their
mean internode distances, assuming that the probability that a node
will send a message to all other nodes with distance i is
(D-i+1) / ( 1+2+3+ ... +D ), where D is the network
diameter.
This document has been prepared by Professor Azer Bestavros
<best@cs.bu.edu> as the WWW Home Page for
CS-551, which is
part of the NSF-funded
undergraduate curriculum on parallel
computing at BU.
Date of last update: October 3, 1994.