The Community for Technology Leaders
Green Image
<p>The hypercube topology, also known as the Boolean n-cube, has recently been used for multiprocessing systems. The paper considers two structural-reliability models, namely, terminal reliability (TR) and network reliability (NR), for the hypercube. Terminal (network) reliability is defined as the probability that there exists a working path connecting two (all) nodes. There are no known polynomial time algorithms for exact computation of TR or NR for the hypercube. Thus, lower-bound computation is a better alternative, because it is more efficient computationally, and the system will be at least as reliable as the bound. The paper presents algorithms to compute lower bounds on TR and NR for the hypercube considering node and/or link failures. These algorithms provide tighter bounds for both TR and NR than known results and run in time polynomial in the cube dimension n, specifically, within time O(n/sup 2/).</p>
Index Termshypercube networks; parallel architectures; fault tolerant computing; reliability; computational complexity; hypercube topology; Boolean n-cube; lower bounds; reliability; terminal reliability; network reliability; structural-reliability models; hypercube; tighter bounds; time O(n/sup 2/); hypercube architecture; node failure; path generation; reliability bounds; spanning trees

J. Trahan, S. Rai and S. Soh, "Improved Lower Bounds on the Reliability of Hypercube Architectures," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 364-378, 1994.
84 ms
(Ver 3.3 (11022016))