Refer to Figure 6.14b, which shows an n-cube interconnect topology of order 3 that interconnects 8 nodes.
Question:
1. Develop an equation that computes how many links in the n-cube (where n is the order of the cube) can fail and we can still guarantee an unbroken link will exist to connect any node in the n-cube.
2. Compare the resiliency to failure of n-cube to a fully connected interconnection network. Plot a comparison of reliability as a function of the added number of links for the two topologies.
Figure 6.14b
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Computer Organization and Design The Hardware Software Interface
ISBN: 978-0124077263
5th edition
Authors: David A. Patterson, John L. Hennessy
Question Posted: