ACM Home Page
Please provide us with feedback. Feedback
Tolerating operational faults in cluster-based FPGAs
Full text PdfPdf (645 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays table of contents
Monterey, California, United States
Pages: 187 - 194  
Year of Publication: 2000
ISBN:1-58113-193-3
Authors
Vijay Lakamraju  Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
Russell Tessier  Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 35,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/329166.329205
What is a DOI?

ABSTRACT

In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain hardware redundancy to allow for continued operation in the presence of operational faults, the need to recover faulty hardware and return it to full functionality quickly and efficiently is great. In addition to providing functional density, FPGAs provide a level of fault tolerance generally not found in mask-programmable devices by including the capability to reconfigure around operational faults in the field. In this paper, incremental CAD techniques are described that allow functional recovery of FPGA design configurations in the presence of single or multiple operational faults. Our preferred approach to fault recovery takes advantage of device routing hierarchy in architectural families such as Xilinx Virtex [2] and Altera Apex [3] to quickly swap unused logic and routing resources in place of faulty ones within logic clusters. These algorithms allow for straight-forward implementation within a local fault-tolerant system without the need to access a remote processing location. If initial recovery attempts through localized swapping fail, an incremental router based on the widely-used PathFinder maze routing algorithm [10] can be applied remotely in an attempt to form connections between newly-allocated logic and interconnect based on the history of the initial design route.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Flez10K Data Sheet. Alters Corporation, 1998.
 
2
Virtez Data Sheet. Xilinx Corporation, 1998.
 
3
Apex Data Sheet. Alters Corporation, 1999.
 
4
 
5
K. Bernhardt. Advanced Technologies for a Command and Data Handling Subsystem in a "Better, Faster, Cheaper" Environment. In 14th Digital Avionics Systems Conference, Cambridge, Ms, Nov. 1995.
 
6
V. Betz and J. Rose. Cluster-Based Logic Blocks for FPGAs: Area-Efficiency vs. Input Sharing and Size. In Proceedings, IEEE Custom Integrated Circuits Conference, pages 551-554, 1997.
 
7
 
8
J. Cong and Y. Diag. FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Design. IEEE Transactions on Computer-Aided Design, pages 1-12, Jan. 1994.
 
9
 
10
 
11
 
12
J. M. Emmert and D. Bhatia. Incremental Routing in FPGAs. In International ASIC Conference (ASIC'98), 1998.
 
13
 
14
I. G. Harris and R. Tessier. Testing Approaches for Cluster-based FPGAs. In submitted to 11th Design Automation Conference, June 2000.
15
16
 
17
N. Howard, A. TyrreU, and N. Allinson. The Yield Enhancement of Field-Programmable Gate Arrays. IEEE Transactions on VLSI Systems, pages 115-123, Mar. 1994.
18
 
19
R. Katz, K. LaBel, J. J. Wang, B. Cronquist, R. Koga, S. Penzin, and G. Swift. Radiation Effects on Current Field ProgrammableTechnologies. IEEE Transactions on Nuclear Science, 44(6):1945-1956, Dec. 1997.
 
20
 
21
 
22
23
 
24
R. Tessier. Negotiated A* Routing for FPGAs. In Proceedings: Fifth Canadian Workshop on Field- Programmable Devices, Montreal, Quebec, June 1998.
 
25
S. Webber and J. Beirne. The Stratus Architecture. In Proceedings: 21st International Symposium on Fault- Tolerant Computing, 1991.
 
26
S. Yang. Logic Synthesis and Optimization Benchmarks. Microelectronics Centre of North Carolina Tech. Report, 1991.

CITED BY  12

Collaborative Colleagues:
Vijay Lakamraju: colleagues
Russell Tessier: colleagues