
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Bruck, R. Cypher, D. Soroker, "Tolerating Faults in Hypercubes Using Subcube Partitioning," IEEE Transactions on Computers, vol. 41, no. 5, pp. 599605, May, 1992.  
BibTex  x  
@article{ 10.1109/12.142686, author = {J. Bruck and R. Cypher and D. Soroker}, title = {Tolerating Faults in Hypercubes Using Subcube Partitioning}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {5}, issn = {00189340}, year = {1992}, pages = {599605}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.142686}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Tolerating Faults in Hypercubes Using Subcube Partitioning IS  5 SN  00189340 SP599 EP605 EPD  599605 A1  J. Bruck, A1  R. Cypher, A1  D. Soroker, PY  1992 KW  fault tolerance; node faults; subcube partitioning; edge faults; worstcase distribution; faulty components; faulttree subgraph; hypercube algorithms; computational complexity; fault tolerant computing; graph theory; hypercube networks; parallel algorithms. VL  41 JA  IEEE Transactions on Computers ER   
The authors examine the issue of running algorithms on a hypercube which has both node and edge faults, and they assume a worstcase distribution of the faults. It is proven that for any constant c, an ndimensional hypercube (ncube) with n/sup c/ faulty components contains a faulttree subgraph that can implement a large class of hypercube algorithms with only a constant factor slowdown. In addition, the approach yields practical implementations for small numbers of faults. For example, it is shown that any regular algorithm can be implemented on an ncube that has at most n1 faults with slowdowns of at most two for computation and at most four for communication. This is the first result showing that an ncube can tolerate more than O(n) arbitrarily placed faults with a constant factor slowdown.
[1] B. Aiello and T. Leighton, "Coding theory, hypercube embeddings, and fault tolerance," inProc. 3rd Annu. ACM Symp. Parallel Algorithms Architectures, 1991, pp. 125136.
[2] F. Annexstein, "Fault tolerance of hypercubederivative networks," inProc. 1st Annu. ACM Symp. Parallel Algorithms Architectures, 1989, pp. 179188.
[3] B. Becker and H. U. Simon, "How robust is thencube?,"Inform. Computat., vol. 77, pp. 162178, 1988.
[4] J. Bruck, "Optimal broadcasting in faulty hypercubes via edgedisjoint embeddings," IBM Res. Rep., RJ7147, 1989.
[5] J. Bruck, R. Cypher, and D. Soroker, "Running algorithms efficiently on faulty hypercubes," inProc. 2nd Annu. ACM Symp. Parallel Algorithms Architectures, 1990, pp. 3744.
[6] M. Y. Chan and S. J. Lee, "Faulttolerant permutation routing in hypercubes," Univ. Texas at Dallas Tech. Rep., UTDCS590.
[7] D. Dolev, J. Y. Halpern, B. Simons, and R. Strong, "A new look at faulttolerant network routing,"Inform. Computat., vol. 72, no. 3, pp. 180196, Mar. 1987.
[8] J. Hastad, T. Leighton, and M. Newman, "Fast computation using faulty hypercubes," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 251263.
[9] D. Kleitman, "On the problem by Yuzvinsky on separating thencube,"Discrete Math., vol. 60, pp. 207213, 1986.
[10] T. Leighton and B. Maggs, "Expanders might be practical: Fast algorithms for routing around faults on multibutterflies," inProc. 30th Annu. IEEE Symp. Foundations Comput. Sci., 1989, pp. 384389.
[11] M. Livingston, Q. Stout, N. Graham, and F. Harary, "Subcube faulttolerance in hypercubes," Tech. Rep. CRLTR1287, Univ. Michigan Comput. Res. Lab., Sept. 1987.
[12] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[13] M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance,"J. ACM, vol. 36, no. 2, Apr. 1989.