Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Testing Layered Interconnection Networks

Published: 01 June 2004 Publication History
  • Get Citation Alerts
  • Abstract

    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 transmission-gate-like 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 post-processing) is O(N^4 WL), where N is the total number of nets, W is the number of switches per switching element, and L is the number of layers. Extensive simulation results are provided.

    References

    [1]
    G. Lemieux P. Leventis and D. Lewis, “Generating Highly Routable Sparse Crossbars for PLDs,” Proc. ACM Int'l Symp. FPGAs, pp. 155-164, 2000.
    [2]
    V. Betz and J. Rose, “Automatic Generation of FPGA Routing Architectures from High-Level Descriptions,” Proc. ACM Int'l Symp. FPGAs, pp. 175-186, 2000.
    [3]
    Y.-W. Chang D.F. Wong and C.K. Wong, “Universal Switch-Module Design for Symmetric-Array-Based FPGAs,” Proc. ACM Int'l Symp. FPGAs, pp. 80-86, 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. 45-54, 1998.
    [5]
    X.T. Chen and F. Lombardi, “A Coloring Approach to the Structural Diagnosis of Interconnects,” Proc. IEEE Int'l Conf. Computer-Aided Design, pp. 676-680, 1996.
    [6]
    C. Wu and T. Feng, “Fault Diagnosis for a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 30, no. 10, pp. 743-758, 1981.
    [7]
    F. Lombardi and W.-K. Huang, “On the Constant Diagnosability of Baseline Interconnection Networks,” IEEE Trans. Computers, vol. 39,no. 12, pp. 1485-1488, 1990.
    [8]
    C. Feng F. Lombardi and W.-K. Huang, “Detection and Location of Multiple Faults in Baseline Interconnection Networks,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1340-1344, 1992.
    [9]
    W.T. Cheng J.L. Lewandowski and E. Wu, “Diagnosis for Wiring Interconnects,” Proc. Int'l Test Conf., pp. 565-571, 1990.
    [10]
    T.H. Cormen C.E. Leiserson and R.L. Rivest, Introduction To Algorithms, pp. 579-629. New York: McGraw-Hill, 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. 113-127, 1960.
    [12]
    W.H. Kautz, “Testing for Fault in Wiring Networks,” IEEE Trans. Computers, vol. 23, no. 4, pp. 358-363, 1974.
    [13]
    J.V. Leeuwen, Handbook of Theoretical Computer Science, vol. A, pp. 591-592. 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. 204-209, 1996.
    [15]
    J. Rose and S. Brown, “Flexibility of Interconnection Structure for Field Programmable Gate Arrays,” IEEE J. Solid-State Circuits, vol. 26,no. 13, pp. 277-282, 1991.
    [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. 71-77, 1989.
    [18]
    A. Hassan J. Rajski and V.K. Agrawal, “Testing and Diagnosis of Interconnects Using Boundary-Scan,” Proc. IEEE Int'l Test Conf., pp. 126-137, 1985.
    [19]
    C. Wu and T. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, 1980.
    [20]
    M.A. Franklin, “VLSI Performance Comparison of Banyan and Crossbar Communication Networks,” IEEE Trans. Computers, vol. 30,no. 4, pp. 283-290, 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. 32-45, 1991.
    [22]
    A. Mourad B. Ozden and M. Malek, “Comprehensive Testing of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 40,no. 8, pp. 935-951, 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. 55-65, 1981.

    Cited By

    View all
    • (2016)A Routability-Aware Algorithm for Both Global and Local Interconnect Resource Test and Diagnosis of Xilinx SRAM-FPGAsJournal of Electronic Testing: Theory and Applications10.1007/s10836-016-5622-032:6(749-762)Online publication date: 1-Dec-2016

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Computers
    IEEE Transactions on Computers  Volume 53, Issue 6
    June 2004
    144 pages

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 01 June 2004

    Author Tags

    1. 65
    2. Fault detection
    3. fault tolerance
    4. layered interconnection networks
    5. network flow.
    6. switch

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 12 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2016)A Routability-Aware Algorithm for Both Global and Local Interconnect Resource Test and Diagnosis of Xilinx SRAM-FPGAsJournal of Electronic Testing: Theory and Applications10.1007/s10836-016-5622-032:6(749-762)Online publication date: 1-Dec-2016

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media