High level synthesis techniques for efficient built-in-self-repair

Built-in-self-repair (BISR) is a hardware redundancy fault tolerance technique, where a set of spare modules is provided in addition to core operational modules. Until now, the application of BISR methodology has been limited to situations where a failed module of one type can only be replaced by a backup module of the same type. It is shown that in ASIC designs it is possible to enable replacement of modules of different types with the same spare units by exploiting the flexibility of high level synthesis solutions. Resource allocation, assignment and scheduling techniques that support a new BISR methodology are presented. All mentioned high level synthesis algorithms are developed on top of the HYPER high level synthesis system, using a novel statistical methodology for heuristic algorithm development and improvement. The effectiveness of the approach is verified and yield improvement data is presented for numerous real-life examples.

[1]  Alice C. Parker,et al.  The high-level synthesis of digital systems , 1990, Proc. IEEE.

[2]  Miodrag Potkonjak,et al.  Fast prototyping of datapath-intensive architectures , 1991, IEEE Design & Test of Computers.

[3]  Miodrag Potkonjak,et al.  High level synthesis for reconfigurable datapath structures , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[4]  R. Pinkham,et al.  An 11-million Transistor Neural Network Execution Engine , 1991, 1991 IEEE International Solid-State Circuits Conference. Digest of Technical Papers.

[5]  J. M. Rabaey,et al.  A Data-driven Architecture For Rapid Prototyping Of High Throughput Dsp Algorithms , 1992, Workshop on VLSI Signal Processing.

[6]  W.R. Moore,et al.  A review of fault-tolerant techniques for the enhancement of integrated circuit yield , 1986, Proceedings of the IEEE.

[7]  Charles H. Stapper.  A new statistical approach for fault-tolerant VLSI systems , 1992, [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing.

[8]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[9]  Miodrag Potkonjak,et al.  An integrated system for rapid prototyping of high performance algorithm specific data paths , 1992, [1992] Proceedings of the International Conference on Application Specific Array Processors.

[10]  Wayne Wolf,et al.  High-Level VLSI Synthesis , 1991 .

[11]  Ramesh Karri,et al.  Transformation-based high-level synthesis of fault-tolerant ASICs , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[12]  Miodrag Potkonjak,et al.  Complexity Estimation for Real Time Application Specific Circuits , 1991, ESSCIRC '91: Proceedings - Seventeenth European Solid-State Circuits Conference.

[13]  Melvin A. Breuer,et al.  On Area and Yield Considerations for Fault-Tolerant VLSI Processor Arrays , 1984, IEEE Transactions on Computers.

[14]  Miodrag Potkonjak,et al.  A Scheduling and Resource Allocation Algorithm for Hierarchical Signal Flow Graphs , 1989, 26th ACM/IEEE Design Automation Conference.

[15]  Karl N. Levitt,et al.  A study of the data commutation problems in a self-repairable multiprocessor , 1899, AFIPS '68 (Spring).

[16]  Frank Thomson Leighton,et al.  Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.