
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B.M. Maziarz, V.K. Jain, "Automatic Reconfiguration and Yield of the TESH Multicomputer Network," IEEE Transactions on Computers, vol. 51, no. 8, pp. 963972, August, 2002.  
BibTex  x  
@article{ 10.1109/TC.2002.1024742, author = {B.M. Maziarz and V.K. Jain}, title = {Automatic Reconfiguration and Yield of the TESH Multicomputer Network}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {8}, issn = {00189340}, year = {2002}, pages = {963972}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1024742}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Automatic Reconfiguration and Yield of the TESH Multicomputer Network IS  8 SN  00189340 SP963 EP972 EPD  963972 A1  B.M. Maziarz, A1  V.K. Jain, PY  2002 KW  Interconnection networks KW  hierarchical networks KW  TESH KW  parallel computing systems KW  VLSI KW  ULSI KW  manufacturing defects KW  faulttolerance KW  redundancy KW  reconfiguration KW  routing KW  yield. VL  51 JA  IEEE Transactions on Computers ER   
This paper considers defect tolerance issues for parallel computing systems based on a new interconnection network, namely "Tori connected mESHes (TESH)." Key features of this network are the following: It is hierarchical, thus allowing exploitation of computation locality and systematic expansion up to a million processors, and it appears to be wellsuited for VLSI/ULSI realization, including 3D implementation. The goal here is to present efficient reconfiguration algorithms for such hierarchical parallel computing systems. Despite the dramatic improvement in defect density in recent years, it is still necessary to provide redundancy and defect circumvention to achieve acceptable systemlevel yields for large multicomputer systems. The TESHbased parallel systems are no exception. Therefore, we develop placement and routing algorithms that assign logical nodes to healthy physical nodes and configure switches to bypass the defective cells, switches, and links. Simulations indicate that the placement (or remapping) is nearly 100 percent effective, while the routing performance diminishes with increasing defect density for a given extent of redundancy. The approach scales up well because, in TESH networks, essentially the same kind of sparing is used at all levels.
[1] A. ElAmawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 3142, 1991.
[2] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted nCube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 8893, Jan. 1991.
[3] J.M. Kumar and L.M. Patnaik, "Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes," IEEE Trans. Parallel and Distributed Systems, pp. 4557, 1992.
[4] N.F. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 40, no. 3, pp. 284294, Mar. 1991.
[5] S.G. Ziavras, “A Versatile Family of Reduced Hypercube Interconnection Network,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 12101220, Nov. 1994.
[6] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 13121316, Nov. 1991.
[7] D.R. Duh, G.H. Chen, and J.F. Fang, “Algorithms and Properties of a New TwoLevel Network with Folded Hypercubes as Basic Modules,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 7, pp. 714723, July 1995.
[8] K. Hwang and J. Ghosh, "Hypernet: A Communication Efficient Architecture for Constructing Massively Parallel Computers," IEEE Trans. Computers, pp. 1,4501,466, 1987.
[9] B.M. Maziarz and V.K. Jain, “Hypernets for Metroarea Networks: A Deadlock Free Routing Technique,” Proc. Int'l Conf. Comm., pp. 18471853, 1993.
[10] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[11] S. Horiguchi and S. Fukuda, “A Hierarchical Redundant Cube Connected Cycles for WSI Yield Enhancement,” Proc. IEEE Int'l Conf. Wafer Scale Integration, pp. 163171, 1995.
[12] K. Ghose and K.R. Desai, "Hierarchical Cubic Networks," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 427435, Apr. 1995.
[13] V.K. Jain and S. Horiguchi, “VLSI Considerations for TESH: A New Hierarchical Interconnection Network for 3D Integration,” IEEE Trans. VLSI Systems, pp. 346353, Sept. 1998.
[14] V.K. Jain, T. Ghirmai, and S. Horiguchi, “TESH: A New Hierarchical Interconnection Network for Massively Parallel Computing,” IEICE Trans. Information and Systems (Japan), vol. E80D, no. 9, Sept. 1997.
[15] V.K. Jain, T. Ghirmai, and S. Horiguchi, “Reconfiguration and Yield for TESH: A New Interconnection Network for 3D Integration,” Proc. Int'l Conf. Innovative Systems in Silicon, pp. 288297, Oct. 1996.
[16] B.M. Maziarz and V.K. Jain, “Implementation of 2D Wavelet Transform on TESH Connected Parallel Processors,” Proc. Int'l Symp. Circuits and Systems (ISCAS), May 1998.
[17] B.M. Maziarz and V.K. Jain, “Rapid Prototyping of Parallel Processing Systems on TESH,” Proc. IEEE Int'l Workshop Rapid Prototyping. June 1998.
[18] W.J. Dally and C.L. Seitz, “The Torus Routing Chip,” Distributed Computing, pp. 187196, 1986.
[19] B.M. Maziarz, “Reconfigurable TESH Connected Parallel Computers,” PhD dissertation, Univ. of South Florida, July 1998.
[20] G. Chevalier and G. Saucier, “A Programmable Switch Matrix for the Wafer Scale Integration of a Processor Array,” 1986.
[21] A. Boubekeur, J.L. Patry, G. Saucier, and J. Trilhe, “Universal Switching Network: Application to a WSI SMID Array,” Proc. IEEE Int'l Conf. Wafer Scale Integration, pp. 256262, 1991.
[22] M. Sami and R. Stefanelli, “Reconfigurable Architectures for VLSI Implementation,” Proc. NCC '83, May 1983.
[23] M. Sami and R. Stefanelli, “Reconfigurable Architectures for VLSI Processing Arrays,” Proc. IEEE, vol. 74, no. 5, May 1986.