
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, C. Ho, "FaultTolerant Meshes and Hypercubes with Minimal Numbers of Spares," IEEE Transactions on Computers, vol. 42, no. 9, pp. 10891104, September, 1993.  
BibTex  x  
@article{ 10.1109/12.241598, author = {J. Bruck and R. Cypher and C. Ho}, title = {FaultTolerant Meshes and Hypercubes with Minimal Numbers of Spares}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {9}, issn = {00189340}, year = {1993}, pages = {10891104}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.241598}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  FaultTolerant Meshes and Hypercubes with Minimal Numbers of Spares IS  9 SN  00189340 SP1089 EP1104 EPD  10891104 A1  J. Bruck, A1  R. Cypher, A1  C. Ho, PY  1993 KW  faulttolerant meshes; hypercubes; ddimensional mesh; faulttolerant architecture; multiplexers; buses; tori; hexagonal meshes; fault tolerant computing; hypercube networks; performance evaluation. VL  42 JA  IEEE Transactions on Computers ER   
This paper presents several techniques for tolerating faults in ddimensional mesh and hypercube architectures. The approach consists of adding spare processors and communication links so that the resulting architecture will contain a faultfree mesh or hypercube in the presence of faults. The authors optimize the cost of the faulttolerant architecture by adding exactly k spare processors (while tolerating up to k processor and/or link faults) and minimizing the maximum number of links per processor. For example, when the desired architecture is a ddimensional mesh and k=1, they present a faulttolerant architecture that has the same maximum degree as the desired architecture (namely, 2d) and has only one spare processor. They also present efficient layouts for faulttolerant two and threedimensional meshes, and show how multiplexers and buses can be used to reduce the degree of faulttolerant architectures. Finally, they give constructions for faulttolerant tori, eightconnected meshes, and hexagonal meshes.
[1] F. Annexstein, "Fault tolerance of hypercubederivative networks," inProc. 1st Annu. ACM Symp. Parallel Algorithms Architectures, 1989, pp. 179188.
[2] V. Balasubramanian and P. Banerjee, "A faulttolerant massively parallel processing architecture,"J. Parallel Distributed Computing, vol. 4, pp. 363383, 1987.
[3] K. E. Batcher, "Design of a massively parallel processor,"IEEE Trans. Comput., vol. C29, no. 9, pp. 836840, 1980.
[4] R. Beivide, E. Herrada, J. L. Balcázar, and J. Labarta, "Optimized meshconnected networks for SIMD and MIMD architectures," inProc. 14th Int. Symp. Comput. Architecture, June 1987, pp. 163170.
[5] J. Bruck, R. Cypher, and C. T. Ho, "On the construction of faulttolerant cubeconnected cycles networks," inProc. 1991 Int. Conf. on Parallel Processing, vol. I, pp. 692693.
[6] J. Bruck, R. Cypher, and D. Soroker, "Running algorithms efficiently on faulty hypercubes," inProc. 2nd Annu. ACM Symp. Parallel Algorithms Architectures, 1990, pp. 3744.
[7] M.S. Chen, K. G. Shin, and D. D. Kandlur, "Addressing, routing, and broadcasting in hexagonal mesh multiprocessors,"IEEE Trans. Comput., vol. C39, no. 1, pp. 1018, 1990.
[8] S. Dutt and J. P. Hayes, "On designing and reconfiguringkfaulttolerant tree architectures,"IEEE Trans. Comput., vol. C39, no. 4, pp. 490503, 1990.
[9] S. Dutt and J. P. Hayes, "Designing faulttolerant systems using automorphisms,"J. Parallel Distributed Comput., pp. 249268, July 1991.
[10] S. Dutt and J. P. Hayes, "Some practical issues in the design of faulttolerant multiprocessors," inProc. 21st Int. Symp. on FaultTolerant Computing, 1991, pp. 292299.
[11] B. Elspas and J. Turner, "Graphs with circulant adjacency matrices,"J. Combinatorial Theory, no. 9, pp. 297307, 1970.
[12] J. Hastad, T. Leighton, and M. Newman, "Fast computation using faulty hypercubes," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 251263.
[13] J. P. Hayes, "A graph model for faulttolerant computing systems,"IEEE Trans. Comput., vol. C25, no. 9, pp. 875884, 1976.
[14] C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas, "Asymptotically tight bounds for computing with faulty arrays of processors," inProc. 31st Annu. Symp. Foundations Comput. Sci., IEEE, Oct. 1990, pp. 285296.
[15] S. Y. Kung, S. N. Jean, and C. W. Chang, "Faulttolerant array processors using singletrack switches,"IEEE Trans. Comput., vol. C38, no. 4, pp. 501514, 1989.
[16] SY. Kuo and W. K. Fuchs, "Efficient spare allocation for reconfigurable arrays,"IEEE Design and Test, pp. 2431, 1987.
[17] F. T. Leighton and C. E. Leiserson, "Wafer scale integration of systolic arrays,"IEEE Trans. Computers, vol. C34, no. 5, pp. 448461, 1985.
[18] A. J. Martin, "The torus: An exercise in constructing a processing surface," inProc. 2nd Caltech Conf. on VLSI, 1981, pp. 527537.
[19] M. Paoli, W. W. Wong, and C. K. Wong, "Minimum kHamiltonian graphs, II,"J. Graph Theory, vol. 10, pp. 7995, 1986.
[20] Setting New Horizons. Aachen, Germany: Parsytec Computer GmbH, 1991.
[21] A. L. Rosenberg, "The Diogenes approach to testable faulttolerant VLSI processor arrays,"IEEE Trans. Comput., vol. C32, no. 10, pp. 902910, 1983.
[22] A. L. Rosenberg, "Routing with permuters: Toward reconfigurable and faulttolerant networks," Tech. Rep. CS198113, Dept. of Computer Science, Duke University, Durham, NC, 1981.
[23] A. L. Rosenberg, "On designing faulttolerant VLSI processor arrays,"Advances in Computing Research, vol. 2, pp. 181204, 1984.
[24] V. P. Roychowdhury, J. Bruck, and T. Kailath, "Efficient algorithms for reconfiguration in VLSI/WSI arrays,"IEEE Trans. Comput., vol. C39, no. 4, pp. 480489, 1990.
[25] M. R. Samatham and D. K. Pradhan, "The de Bruijn multiprocessor network: A versatile network for parallel computation,"IEEE Trans. Comput., vol. 38, no. 4, pp. 567581, 1989.
[26] M. Sami and R. Stefanelli, "Reconfigurable architectures for VLSI processing arrays,"Proc. IEEE, vol. 74, no. 5, 1986.
[27] Y. Ueokaet al., "A defect tolerant design for fullwafer memory LSI,"IEEE J. SolidState Circuits, vol. SC19, pp. 319324, June 1984.
[28] W. W. Wong and C. K. Wang, "Minimum kHamiltonian graphs,"J. Graph Theory, vol. 8, pp. 155165, 1984.