Reconfiguration algorithms for degradable VLSI arrays with switch faults

• المؤلفون الرئيسيون: Zhu, Yuanbo, Wu, Jigang, Lam, Siew-Kei, Srikanthan, Thambipillai
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2013
• الموضوعات: DRNTU::Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/98212; http://hdl.handle.net/10220/12425
• المؤسسة: Nanyang Technological University

The problem of reconfiguring two-dimensional VLSI arrays with faults is to find a maximum logical array without faults. The existing algorithms only consider faults associated with processing elements, and all switches and links are assumed to be fault-free. But switch faults may often occur in the network-on-chips with high density. In this paper, two novel approaches are proposed to tackle the reconfiguration problem of degradable VLSI arrays with switch faults. The first approach extends the well-known existing algorithm with simple pre-processing and row bypass scheme. The second one employs a novel row and column rerouting scheme to maximize the size of the logical array. Simulation results show that the proposed two approaches can effectively generate the logical arrays on the given host array with switch faults, and the second algorithm performs more favorably with the increasing number of the switch faults.