Reconfiguration algorithms for degradable VLSI arrays with switch faults
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...
Saved in:
Main Authors: | Zhu, Yuanbo, Wu, Jigang, Lam, Siew-Kei, Srikanthan, Thambipillai |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/98212 http://hdl.handle.net/10220/12425 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Algorithms for reconfiguring NoC-based fault-tolerant multiprocessor arrays
by: Wu, Jigang, et al.
Published: (2020) -
ALGORITHMS FOR RECONFIGURATION PROBLEMS IN VLSI/WSI ARRAYS
by: LOW CHOR PING
Published: (2020) -
Exploiting FPGA-aware merging of custom instructions for runtime reconfiguration
by: Lam, Siew-Kei, et al.
Published: (2013) -
High performance VLSI arithmetic macrocells
by: Thambipillai Srikanthan, et al.
Published: (2008) -
Algorithmic aspects for multiple-choice hardware/software partitioning
by: Wu, Jigang, et al.
Published: (2013)