Please use this identifier to cite or link to this item:
Title: Reconfiguration algorithms for degradable VLSI arrays with switch faults
Authors: Zhu, Yuanbo
Wu, Jigang
Lam, Siew-Kei
Srikanthan, Thambipillai
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2012
Source: Zhu, Y., Wu, J., Lam, S. K., & Srikanthan, T. (2012). Reconfiguration Algorithms for Degradable VLSI Arrays with Switch Faults . 2012 IEEE 18th International Conference on Parallel and Distributed Systems.
Abstract: 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.
DOI: 10.1109/ICPADS.2012.56
Rights: © 2012 IEEE.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Conference Papers

Citations 50

Updated on Jan 22, 2023

Web of ScienceTM
Citations 50

Updated on Jan 24, 2023

Page view(s) 10

Updated on Jan 26, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.