Phantom redundancy: a register transfer level technique for gracefully degradable data path synthesis

Presents an area-efficient register transfer level technique for gracefully degradable data path synthesis called phantom redundancy. In contrast to spare-based approaches, phantom redundancy is a recovery technique that does not use any standby spares. Phantom redundancy uses extra interconnect to make the resulting data path reconfigurable in the presence of any (single) functional unit failure. When phantom redundancy is combined with a concurrent error detection technique, error detection followed by reconfiguration is automatic. The authors developed a register transfer level synthesis algorithm that incorporates phantom redundancy constraints. There is a tight interdependence between reconfiguration of a (faulty) data path and scheduling and operation-to-operator binding tasks during register transfer level synthesis. They developed a genetic algorithm-based register transfer level synthesis approach to incorporate phantom redundancy constraints. The algorithm minimizes the performance degradation of the synthesized data path in the presence of any single faulty functional unit. The effectiveness of the technique and the algorithm are illustrated using high-level synthesis benchmarks.

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

[2]  Miodrag Potkonjak,et al.  Behavioral-level synthesis of heterogeneous BISR reconfigurable ASIC's , 1998, IEEE Trans. Very Large Scale Integr. Syst..

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

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

[5]  W. Kent Fuchs,et al.  Efficient Spare Allocation for Reconfigurable Arrays , 1987 .

[6]  W Stephen OPTIMIZATION OF PARAMETRIC YIELD , 1991 .

[7]  R. Ramaswami,et al.  Book Review: Design and Analysis of Fault-Tolerant Digital Systems , 1990 .

[8]  Niraj K. Jha,et al.  Behavioral synthesis of fault secure controller/datapaths using aliasing probability analysis , 1996, Proceedings of Annual Symposium on Fault Tolerant Computing.

[9]  W. Kent Fuchs,et al.  Efficient Spare Allocation in Reconfigurable Arrays , 1986, 23rd ACM/IEEE Design Automation Conference.

[10]  Georges R. Harik,et al.  Foundations of Genetic Algorithms , 1997 .

[11]  Niraj K. Jha,et al.  High-level test synthesis: a survey , 1998, Integr..

[12]  Jacques Periaux,et al.  Genetic Algorithms in Engineering and Computer Science , 1996 .

[13]  Giovanni De Micheli,et al.  The Olympus synthesis system , 1990, IEEE Design & Test of Computers.

[14]  Mariagiovanna Sami,et al.  Fault Tolerance Techniques for Array Structures Used in Supercomputing , 1986, Computer.

[15]  Israel Koren,et al.  New routing and compaction strategies for yield enhancement , 1992, Proceedings 1992 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems.

[16]  Miodrag Potkonjak,et al.  HYPER-LP: a system for power minimization using architectural transformations , 1992, ICCAD.

[17]  Niraj K. Jha,et al.  Behavioral Synthesis of Fault Secure Controller/Datapaths Based on Aliasing Probability Analysis , 2000, IEEE Trans. Computers.

[18]  Barry W. Johnson Design & analysis of fault tolerant digital systems , 1988 .

[19]  Ramesh Karri,et al.  Introspection: A register transfer level technique for cocurrent error detection and diagnosis in data dominated designs , 2001, TODE.

[20]  Hans-Joachim Wunderlich,et al.  Synthesizing Fast, Online-Testable Control Units , 1998, IEEE Des. Test Comput..

[21]  Fadi J. Kurdahi,et al.  High-level synthesis of recoverable VLSI microarchitectures , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[22]  Ramesh Karri,et al.  Automatic Synthesis of Self-Recovering VLSI Systems , 1996, IEEE Trans. Computers.

[23]  Fadi J. Kurdahi,et al.  REAL: A Program for REgister ALlocation , 1987, 24th ACM/IEEE Design Automation Conference.

[24]  Robert S. Swarz,et al.  Reliable Computer Systems: Design and Evaluation , 1992 .

[25]  Minh N. Do,et al.  Youn-Long Steve Lin , 1992 .

[26]  Niraj K. Jha,et al.  Behavioral synthesis for easy testability in data path scheduling , 1992, ICCAD.

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  Alex Orailoglu,et al.  Microarchitectural Synthesis of VLSI Designs with High Test Concurrency , 1994, 31st Design Automation Conference.

[29]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Ramesh Karri,et al.  Optimal self-recovering microarchitecture synthesis , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[32]  Daniel D. Gajski,et al.  High ― Level Synthesis: Introduction to Chip and System Design , 1992 .

[33]  Douglas M. Blough,et al.  Optimal recovery point insertion for high-level synthesis of recoverable microarchitectures , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[34]  Ramesh Karri,et al.  Time-constrained scheduling during high-level synthesis of fault-secure VLSI digital signal processors , 1996, IEEE Trans. Reliab..

[35]  G. A. Allan,et al.  A yield improvement technique for IC layout using local design rules , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[36]  Miodrag Potkonjak,et al.  High level synthesis techniques for efficient built-in-self-repair , 1993, Proceedings of 1993 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems.