DocumentCode
301047
Title
Behavioral synthesis of fault secure controller/datapaths using aliasing probability analysis
Author
Lakshminarayana, Ganesh ; Raghunathan, Anand ; Jha, Niraj K.
Author_Institution
Dept. of Electr. Eng., Princeton Univ., NJ, USA
fYear
1996
fDate
25-27 Jun 1996
Firstpage
336
Lastpage
345
Abstract
We address the problem of synthesizing fault-secure controller/data path circuits from behavioral specifications. We use an iterative improvement based behavioral synthesis framework that performs module selection, clock selection, scheduling, and resource sharing with the aim of minimizing the area of the synthesized circuit, while allowing multicycling, chaining, and module 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 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 bitwidth of 32) in the resultant data path. We report experimental results for several behavioral descriptions that demonstrate the efficacy of our techniques in synthesizing fault-secure controller/datapaths with low overheads
Keywords
clocks; data flow graphs; fault tolerant computing; high level synthesis; logic CAD; probability; scheduling; aliasing probability analysis; behavioral specifications; behavioral synthesis; chaining; circuit synthesis; clock selection; computation; dynamic comparison selection algorithm; fault secure controller synthesis; fault secure datapath synthesis; fault security; low overhead; maximal resource sharing; module pipelining; module selection; multicycling; resource sharing; scheduling; Circuit faults; Circuit synthesis; Clocks; Data security; Fault diagnosis; Heuristic algorithms; Iterative algorithms; Pipeline processing; Processor scheduling; Resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault Tolerant Computing, 1996., Proceedings of Annual Symposium on
Conference_Location
Sendai
ISSN
0731-3071
Print_ISBN
0-8186-7262-5
Type
conf
DOI
10.1109/FTCS.1996.534618
Filename
534618
Link To Document