Swarm intelligence driven design space exploration of optimal k-cycle transient fault secured datapath during high level synthesis based on user power-delay budget

被引:11
作者
Sengupta, Anirban [1 ]
Sedaghat, Reza [2 ]
机构
[1] Indian Inst Technol, Comp Sci & Engn, Indore, Madhya Pradesh, India
[2] Ryerson Univ, Elect & Comp Engn, Toronto, ON, Canada
关键词
High Level Synthesis; Multi-objective design space exploration; DSE; Secured DSE; Control Data Flow Graph (CDFG); k-cycle Fault; Single Event Upsets (SEU); ARCHITECTURAL SYNTHESIS; FUZZY SEARCH; TIME;
D O I
10.1016/j.microrel.2015.03.010
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Fault security indicates ability to provide error detection or fetch correct output. Fault security assures possibility of using either hardware redundancy or time redundancy to optimize the overheads associated with fault security. However, generation (design space exploration (DSE)) of an optimal fault secured datapath structure based on user power-delay budget during high level synthesis (HLS) in the context k-cycle transient fault is considered an intractable problem. This is due to the fact that for every type of candidate design solution produced during exploration, a feasible k-cycle fault secured datapath may not exist which satisfies the conflicting user constraints/budget Secondly, insertion of inapt cut (resulting in an additional checkpoint) to optimize delay overhead associated with fault security in most cases may not result in optimal solutions in the context of user constraints/budgets. The solutions to the above problems have not been addressed in the literature so far. The paper therefore presents the following novelties: (a) an algorithm for fault secured DSE process (b) handling k-cycle transient faults during DSE (c) schemes for selecting appropriate edges for inserting cuts that selects available locations in the scheduled Control Data Flow Graph (CDFG) which minimizes delay overhead associated with fault security (d) swarm intelligence (particle swarm optimization) driven DSE process that adaptively/intelligently computes the candidate design solutions for generating an optimal fault secured datapath. Results of the proposed approach when tested on standard benchmarks yielded optimal results in most cases as evident from the data obtained for generational distance (GD), spacing (S), spreading (Delta) and weighted metric (W-m). Further, results of comparison with a recent approaches indicated significant reduction of final cost (better quality) for the proposed approach. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:990 / 1004
页数:15
相关论文
共 43 条
[1]  
Anirban Sengupta, 2014, SPRINGER BOOK VOLUME, P93
[2]  
[Anonymous], P IEEE COMPUT DIGITA
[3]  
[Anonymous], 2005, FUNDAMENTAL COMPUTAT
[4]   A FAULT-TOLERANT FFT PROCESSOR [J].
CHOI, YH ;
MALEK, M .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (05) :617-621
[5]  
De Michel G., 1994, SYNTHESIS OPTIMIZATI
[6]   DATAPATH SYNTHESIS USING A PROBLEM-SPACE GENETIC ALGORITHM [J].
DHODHI, MK ;
HIELSCHER, FH ;
STORER, RH .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1995, 14 (08) :934-944
[7]   Production and propagation of single-event transients in high-speed digital logic ICs [J].
Dodd, PE ;
Shaneyfelt, MR ;
Felix, JA ;
Schwank, JR .
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, 2004, 51 (06) :3278-3284
[8]  
Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374
[9]  
Ferrandi Fabrizio, 2008, 2008 IEEE Computer Society Annual Symposium on VLSI, P417, DOI 10.1109/ISVLSI.2008.73
[10]  
Gajski D.D., 1992, High-level synthesis: introduction to chip and system design