
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Bin Liu, Fabrizio Lombardi, Nohpill Park, Minsu Choi, "Testing Layered Interconnection Networks," IEEE Transactions on Computers, vol. 53, no. 6, pp. 710722, June, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.17, author = {Bin Liu and Fabrizio Lombardi and Nohpill Park and Minsu Choi}, title = {Testing Layered Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {6}, issn = {00189340}, year = {2004}, pages = {710722}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.17}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Testing Layered Interconnection Networks IS  6 SN  00189340 SP710 EP722 EPD  710722 A1  Bin Liu, A1  Fabrizio Lombardi, A1  Nohpill Park, A1  Minsu Choi, PY  2004 KW  Fault detection KW  layered interconnection networks KW  switch KW  fault tolerance KW  network flow. VL  53 JA  IEEE Transactions on Computers ER   
Abstract—This paper presents an approach for fault detection in layered interconnection networks (LINs). An LIN is a generalized multistage interconnection network commonly used in reconfigurable systems; the nets (links) are arranged in sets (referred to as layers) of different size. Switching elements (made of simple switches such as transmissiongatelike devices) are arranged in a cascade to connect pairs of layers. The switching elements of an LIN have the same number of switches, but the switching patterns may not be uniform. A comprehensive fault model for the nets and switches is assumed at physical and behavioral levels. Testing requires configuring the LIN multiple times. Using a graph approach, it is proven that the minimal set of configurations corresponds to the node disjoint path sets. The proposed approach is based on two novel results in the execution of the network flow algorithm to find node disjoint path sets, while retaining optimality in the number of configurations. These objectives are accomplished by finding a feasible flow such that the maximal degree can be iteratively decreased, while guaranteeing the existence of an appropriate circulation. Net adjacencies are also tested for possible bridge faults (shorts). To account for 100 percent fault coverage of bridge faults a postprocessing algorithm may be required; bounds on its complexity are provided. The execution complexity of the proposed approach (inclusive of test vector generation and postprocessing) is
[1] G. Lemieux, P. Leventis, and D. Lewis, Generating Highly Routable Sparse Crossbars for PLDs Proc. ACM Int'l Symp. FPGAs, pp. 155164, 2000.
[2] V. Betz and J. Rose, Automatic Generation of FPGA Routing Architectures from HighLevel Descriptions Proc. ACM Int'l Symp. FPGAs, pp. 175186, 2000.
[3] Y.W. Chang, D.F. Wong, and C.K. Wong, Universal SwitchModule Design for SymmetricArrayBased FPGAs Proc. ACM Int'l Symp. FPGAs, pp. 8086, 1996.
[4] M.A. Khalid and J. Rose, A Hybrid Complete Graph Partial Crossbar Routing Architecture for Multi FPGA Systems Proc. ACM Int'l Symp. FPGAs, pp. 4554, 1998.
[5] X.T. Chen and F. Lombardi, A Coloring Approach to the Structural Diagnosis of Interconnects Proc. IEEE Int'l Conf. ComputerAided Design, pp. 676680, 1996.
[6] C. Wu and T. Feng, Fault Diagnosis for a Class of Multistage Interconnection Networks IEEE Trans. Computers, vol. 30, no. 10, pp. 743758, 1981.
[7] W.K. Huang and F. Lombardi,“On the constant diagnosability of Baseline interconnection network,” IEEE Trans. Computers, vol. 39, no. 12, pp. 1,4851,488, Dec. 1990.
[8] F. Lombardi,C. Feng, and W.K. Huang,"Detection and Location of Multiple Faults in Baseline Interconnection Networks," IEEE Trans. Computers, vol. 41, no. 10, pp. 1,3401,344, Oct. 1992.
[9] W.T. Cheng, J.L. Lewandowski, and E. Wu, "Diagnosis for Wiring Interconnects," Proc. Int'l Test Conf., pp. 565571, 1990.
[10] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction To Algorithms, pp. 579629. New York: McGrawHill, 1990.
[11] A.J. Hoffman, Some Recent Applications of the Theory of Linear Inequalities to Extremal Combinational Analysis Proc. Symp. Applied Math., vol. 10, pp. 113127, 1960.
[12] W.H. Kautz, Testing for Fault in Wiring Networks IEEE Trans. Computers, vol. 23, no. 4, pp. 358363, 1974.
[13] J.V. Leeuwen, Handbook of Theoretical Computer Science, vol. A, pp. 591592. Cambridge, Mass.: MIT Press, 1990.
[14] F. Lombardi, X.T. Chen, and W.K. Huang, On the Diagnosis of Programmable Interconnects: Theory and Applications Proc. IEEE VLSI Test Symp., pp. 204209, 1996.
[15] J.S. Rose and S. Brown, "Flexibility of Interconnection Structures for FieldProgrammable Gate Arrays," IEEE J. SolidState Circuits, Vol. 26, No. 3, Mar. 1991, pp. 277282.
[16] Xilinx, Inc., The Programmable Logic Data Book. San Jose, Calif., 1994.
[17] C.W. Yau and N. Jarwala, "A Unified Theory for Designing Optimal Test Generation and Diagnosis Algorithms for Board Interconnects," Proc. Int'l Test Conf., pp. 7177, 1989.
[18] A. Hassan, J. Rajski, and V.K. Agrawal, Testing and Diagnosis of Interconnects Using BoundaryScan Proc. IEEE Int'l Test Conf., pp. 126137, 1985.
[19] C. Wu and T. Feng, On a Class of Multistage Interconnection Networks IEEE Trans. Computers, vol. 29, no. 8, pp. 694702, 1980.
[20] M.A. Franklin, VLSI Performance Comparison of Banyan and Crossbar Communication Networks IEEE Trans. Computers, vol. 30, no. 4, pp. 283290, 1981.
[21] M. Patyra and W. Maly, Circuit Design for a Large Area High Performance Crossbar Switch Proc. IEEE Int'l Workshop DFT on VLSI Systems, pp. 3245, 1991.
[22] A. Mourad, B. Ozden, and M. Malek, Comprehensive Testing of Multistage Interconnection Networks IEEE Trans. Computers, vol. 40, no. 8, pp. 935951, 1991.
[23] J.D. Ullman, Computational Aspects of VLSI. Rockville, Md.: Computer Science Press, 1984.
[24] Y. Chen, D. Lawrie, D. Padua, and P. Yew, Interconnection Networks Using Shuffles Computer, vol. 14, no. 12, pp. 5565, 1981.