Research
| Line 138: | Line 138: | ||
We examine reconfigurable crossbar arrays by considering randomly occurred '''stuck-open and stuck-closed crosspoint faults'''. In the presence of '''permanent''' faults, a fast and accurate heuristic algorithm is proposed that uses the techniques of index sorting, backtracking, and row matching. In the presence of '''transient''' faults, tolerance analysis is performed by formally and recursively determining tolerable fault positions | We examine reconfigurable crossbar arrays by considering randomly occurred '''stuck-open and stuck-closed crosspoint faults'''. In the presence of '''permanent''' faults, a fast and accurate heuristic algorithm is proposed that uses the techniques of index sorting, backtracking, and row matching. In the presence of '''transient''' faults, tolerance analysis is performed by formally and recursively determining tolerable fault positions | ||
| + | |||
| + | Since '''density''' feature of crossbar architectures is the main attracting point, we perform a detailed yield analysis by considering both uniform and non-uniform defect distributions. | ||
| + | We formalize an approximate successful mapping probability metric for uniform distributions | ||
| + | and determine '''area overheads'''. | ||
[[Image:nanoarray_fault_tolerance.png|center|none|500px|link=]] | [[Image:nanoarray_fault_tolerance.png|center|none|500px|link=]] | ||
Revision as of 12:35, 27 November 2017
We aim to develop a complete synthesis and performance optimization methodology for switching nano-crossbar arrays that leads to the design and construction of an emerging nanocomputer. Our objectives are 1) synthesizing Boolean functions with area optimization; 2) achieving fault tolerance; 3) performing performance optimization by considering area, delay, power, and accuracy; 4) implementing arithmetic and memory elements; and 5) realizing a synchronous state machine.
Logic Synthesis | |||||||||||||||||||||||||||||||||
|
We study implementation of Boolean functions with nano-crossbar arrays where each crosspoint behaves as a diode, a FET, and a four-terminal switch. For these three types, we give array size formulations for a given Boolean function. Additionally, we focus on four-terminal switch based implementations and propose an algorithm that implements Boolean functions with optimal array sizes. 
| |||||||||||||||||||||||||||||||||
Fault Tolerance | ||||||||||||||||||||||||||||||||||||||||
|
We examine reconfigurable crossbar arrays by considering randomly occurred stuck-open and stuck-closed crosspoint faults. In the presence of permanent faults, a fast and accurate heuristic algorithm is proposed that uses the techniques of index sorting, backtracking, and row matching. In the presence of transient faults, tolerance analysis is performed by formally and recursively determining tolerable fault positions Since density feature of crossbar architectures is the main attracting point, we perform a detailed yield analysis by considering both uniform and non-uniform defect distributions. We formalize an approximate successful mapping probability metric for uniform distributions and determine area overheads. 
| ||||||||||||||||||||||||||||||||||||||||
Performance Modeling and Analysis | |||||||||||||
|
We introduce an accurate capacitor-resistor model for nano-crossbar arrays that is to be used for power/delay/area performance analysis and optimization. In order to find capacitor and resistor values, we investigate upper/lower value limits for technology dependent parameters including doping concentration, nanowire dimension, pitch size, and layer thickness. We also use different fan-out capacitors to test the integration capability of these technologies. 
| |||||||||||||
