This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scalable FPGA Refurbishment Using Netlist-Driven Evolutionary Algorithms
Aug. 2013 (vol. 62 no. 8)
pp. 1526-1541
Rizwan A. Ashraf, University of Central Florida, Orlando
Ronald F. DeMara, University of Central Florida, Orlando
In this work, Field-Programmable Gate Array (FPGA) reconfigurability is exploited to realize autonomous fault recovery in mission-critical applications at runtime. The proposed Netlist-Driven Evolutionary Refurbishment technique utilizes design-time information from the circuit netlist to constrain the search space of the algorithm by up to 98.1 percent in terms of the chromosome length representing reconfigurable logic elements. This facilitates refurbishment of relatively large-sized FPGA circuits as compared to previous works. Hence, the scalability issue associated with Evolvable Hardware-Based refurbishment is addressed and improved. Experiments are conducted with multiple circuits from the MCNC benchmark suite to validate the approach and assess its benefits and limitations. Successful refurbishment of the apex4 circuit having a total of 1,252 LUTs with 10 percent spares is achieved in as few as 633 generations on average when subjected to simulated randomly injected single stuck-at faults. Moreover, the use of design-time information about the circuit undergoing refurbishment is validated as means to increase the tractability of dynamic evolvable hardware techniques.
Index Terms:
Circuit faults,Field programmable gate arrays,Genetic algorithms,Hardware,Table lookup,Aging,Evolutionary computation,selective mutation,Evolvable hardware,SRAM-based FPGAs,scalability of genetic algorithms,hard/permanent fault refurbishment,self-healing,survivability,search space pruning
Citation:
Rizwan A. Ashraf, Ronald F. DeMara, "Scalable FPGA Refurbishment Using Netlist-Driven Evolutionary Algorithms," IEEE Transactions on Computers, vol. 62, no. 8, pp. 1526-1541, Aug. 2013, doi:10.1109/TC.2013.58
Usage of this product signifies your acceptance of the Terms of Use.