This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Behavioral Synthesis of Fault Secure Controller/Datapaths Based on Aliasing Probability Analysis
September 2000 (vol. 49 no. 9)
pp. 865-885

Abstract—This paper addresses the problem of synthesizing fault-secure controller/data path circuits from behavioral specifications. These circuits are guaranteed to either produce the correct output, or to flag an error. We use an iterative improvement-based behavioral synthesis framework that performs functional unit selection, clock selection, scheduling, and resource sharing with the aim of minimizing the area of the synthesized circuit, while allowing multicycling, chaining, and functional unit pipelining. We present a dynamic comparison selection algorithm that can be used during behavioral synthesis to determine which intermediate results in the computation need to be secured in order to enable maximal resource sharing. Previous work on synthesizing fault-secure data paths has focused on ensuring that aliasing (a condition when the circuit produces an incorrect output and does not flag an error) cannot occur in any part of the design. We demonstrate that such an approach can lead to unnecessarily large overheads. In order to alleviate the overheads incurred for fault security, our behavioral synthesis framework uses ALiasing Probability analysiS (ALPS) in order to identify resource sharing configurations that reduce area while introducing a very low probability of aliasing (of the order of $10^{-10}$ for a bit-width of 32) in the resultant data path. Experimental results performed for several behavioral descriptions demonstrate that our techniques synthesize more compact circuits than techniques available in the literature, e.g., double moIdular redundancy or zero-aliasing techniques.

[1] R.M. Sedmak and H.L. Leibergot, “Fault Tolerance of a General Purpose Computer by Very Large Scale Integration,” IEEE Trans. Computers, vol. 29, no. 6, pp. 492-500, June 1980.
[2] N. Saxena and E. McCluskey, "Dependable Adaptive Computing Systems," Proc. IEEE Systems, Man, and Cybernetics, Oct. 1998.
[3] R. Karri and A. Orailoglu, “High Level Synthesis of Fault-Tolerant ASICS,” Proc. Design Automation Conf., pp. 419-422, June 1992.
[4] R. Karri and A. Orailoglu, “Scheduling with Rollback Constraints in High Level Synthesis of Self-Recovering ASICS,” Proc. Int'l Symp. Fault-Tolerant Computing, pp. 519-526, June 1992.
[5] K. Hogstedt and A. Orailoglu, “Integrating Binding Constraints in the Synthesis of Area Efficient Self Recovering Microarchitectures,” Proc. Int'l Conf. Computer Design, pp. 331-334, June 1994.
[6] D. Gu, D.J. Rosenkrantz, and S.S. Ravi, “Construction and Analysis of Fault Secure Multiprocessor Schedules,” Proc. Int'l Symp. Fault-Tolerant Computing, pp. 120-127, June 1991.
[7] R. Karri and A. Orailoglu, “High Level Synthesis of Fault Secure Microarchitectures,” Proc. Design Automation Conf., pp. 429-433, June 1993.
[8] S. Sokolov and R. Karri, “Allocation and Binding during Fault Secure Microarchitecture Synthesis,” Proc. Int'l Conf. Computer Design, pp. 327-330, June 1994.
[9] V. Raghavendra and C. Lurnisap, “A Technique for Micro Rollback Self-Recovery Synthesis,” IEEE Trans. Computer-Aided Design, vol. 14, pp. 1,171-1,179, Sept. 1995.
[10] D.M. Blough, F.J. Kurdahi, and S.Y. Ohm, “Optimal Recovery Point Insertion for High-Level Synthesis of Recoverable Microarchitectures,” Proc. Int'l Symp. Fault-Tolerant Computing, pp. 50-59, June 1995.
[11] R. Narasimhan, D.J. Rosenkrantz, and S.S. Ravi, “Algorithms for Analyzing and Synthesizing Fault-Tolerant Datapaths,” Proc. Int'l Workshop Defect and Fault Tolerance in VLSI Systems, pp. 81-89, Nov. 1995.
[12] L.M. Guerra, M.M. Potkonjak, and J.M. Rabaey, “High Level Synthesis of Reconfigurable Data Path Structures,” Proc. Int'l Conf. Computer-Aided Design, pp. 26-29, Nov. 1993.
[13] P.H. Bardell, W.H. McAnney, and J. Savir, Built-In Test for VLSI, John Wiley&Sons, New York, 1987.
[14] S. Devadas, H.K.T. Ma, A.R. Newton, and A. Sangiovanni-Vincentelli, “A Synthesis and Optimization Procedure for Fully and Easily Testable Sequential Machines,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 1,100-1,107, Oct. 1986.
[15] D. Siewiorek and R. Swarz, Reliable Computer Systems: Design and Evaluation. Digital Press, 1992.
[16] A. Raghunathan and N.K. Jha, “An Iterative Improvement Algorithm for Low Power Datapath Synthesis,” Proc. Int'l Conf. Computer-Aided Design, pp. 597-602, Nov. 1995.
[17] I.C. Park and C.M. Kyung, “FAMOS: An Efficient Scheduling Algorithm for High-Level Synthesis,” IEEE Trans. Computer-Aided Design, vol. 12, pp. 1,437-1,448, Oct. 1993.
[18] S. Devadas and A.R. Newton, “Algorithms for Hardware Allocation in Data Path Synthesis,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 768-781, July 1989.
[19] E.L. Lawler, “Cutsets and Partitions of Hypergraphs,” Networks, vol. 3, pp. 275-285, 1973.
[20] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.

Index Terms:
Behavioral synthesis, concurrent error detection, fault security, fault-tolerant microarchitectures.
Citation:
Ganesh Lakshminarayana, Anand Raghunathan, Niraj K. Jha, "Behavioral Synthesis of Fault Secure Controller/Datapaths Based on Aliasing Probability Analysis," IEEE Transactions on Computers, vol. 49, no. 9, pp. 865-885, Sept. 2000, doi:10.1109/12.869319
Usage of this product signifies your acceptance of the Terms of Use.