EVOHAR Robustness in Evolved Hardware Jason Masner, John Cavalieri Dr. James Frenzel and Dr. James A. Foster.

Slides:

Advertisements

Similar presentations

1 Denial of Service in Sensor Networks Authors: Anthony D. Wood, John A. Stankovic Presented by: Aiyaz Amin Paniwala.

Advertisements

Computer Engineering II

10/14/2005Caltech1 Reliable State Machines Dr. Gary R Burke California Institute of Technology Jet Propulsion Laboratory.

Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)

Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno

Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.

Energy Aware Self Organized Communication in Complex Networks Jakob Salzmann, Dirk Timmermann SPP 1183 Third Colloquium Organic Computing, ,

FPGA Design Flow Design Circuit Simulation Implementation Programming.

Mechanics of Genetic Programming

Evolvable by Design Panos Oikonomou James Franck Institute Institute of Biophysical Dynamics The University of Chicago Philippe Cluzel How topology affects.

1 Evolution in Computation James A. Foster Initiative for Bioinformatics And Evolutionary Studies (IBEST), MRCI, CSDS, and Computer Science University.

A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.

NEW TIES WP2 Agent and learning mechanisms. Decision making and learning Agents have a controller (decision tree, DQT)  Input: situation (as perceived.

Evolving Agents in a Hostile Environment Alex J. Berry.

Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)

Presented by Ozgur D. Sahin. Outline Introduction Neighborhood Functions ANF Algorithm Modifications Experimental Results Data Mining using ANF Conclusions.

Evolving Pre-Sort Algorithms Joe Barker. Why Sorting? Sorting is used everywhere Classical methods for developing new algorithms has been pretty much.

Introduction to Field Programmable Gate Arrays (FPGAs) COE 203 Digital Logic Laboratory Dr. Aiman El-Maleh College of Computer Sciences and Engineering.

Evolvable Hardware: Brief introduction to the module Andy Tyrrell Department of Electronics B005 -

DESIGN OF A SELF- ORGANIZING LEARNING ARRAY SYSTEM Dr. Janusz Starzyk Tsun-Ho Liu Ohio University School of Electrical Engineering and Computer Science.

Ontogenetic systems Drawing inspiration from growth and healing processes of living organisms… …and applying them to electronic computing systems Phylogeny.

Khaled Rasheed Computer Science Dept. University of Georgia

Genetic Programming System for Music Generation With Automated Fitness Raters.

Genetic Programming Chapter 6. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Genetic Programming GP quick overview Developed: USA.

Dr M F Abbod Using Intelligent Optimisation Methods to Improve the Group Method of Data Handling in Time Series Prediction Maysam Abbod and Karishma Dashpande.

Breeding Decision Trees Using Evolutionary Techniques Papagelis Athanasios - Kalles Dimitrios Computer Technology Institute & AHEAD RM.

Labs Practicing in Design of Combinational Networks and FSM with Concurrent Error Detection Tatjana Stanković, Goran Djordjević, Mile Stojčev 2075 Microprocessor.

Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.

Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.

Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.

Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, , Braunschweig Institute of Applied Microelectronics.

Investigation of the Effect of Neutrality on the Evolution of Digital Circuits. Eoin O’Grady Final year Electronic and Computer Engineering Project.

Zorica Stanimirović Faculty of Mathematics, University of Belgrade

What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.

Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.

1 Design GA-Fuzzy Controller for Magnetic Levitation Using FPGA Prepared by Hosam.M Abu Elreesh Advisor Dr. Basil Hamed.

Computer Science and Mathematical Basics Chap. 3 발표자 : 김정집.

An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay

Fuzzy Genetic Algorithm

Code Complete Steve McConnell. 20. The Software-Quality Landscape.

Artificial Intelligence Chapter 4. Machine Evolution.

Evolution Programs (insert catchy subtitle here).

4/19/20021 TCPSplitter: A Reconfigurable Hardware Based TCP Flow Monitor David V. Schuehler.

1 Genetic Algorithms and Ant Colony Optimisation.

Hot Interconnects TCP-Splitter: A Reconfigurable Hardware Based TCP/IP Flow Monitor David V. Schuehler

Chapter 9 Genetic Algorithms.  Based upon biological evolution  Generate successor hypothesis based upon repeated mutations  Acts as a randomized parallel.

Genetic Programming A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 6.

1 Danny Hillis and Co-evolution Between Hosts and Parasites I 590 4/11/2005 Pu-Wen(Bruce) Chang.

In the name of ALLAH Presented By : Mohsen Shahriari, the student of communication in Sajad institute for higher education.

1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.

Genetic Search Algorithms Matt Herbster. Why Another Search?  Designed in the 1950s, heavily implemented under John Holland (1970s)  Genetic search.

An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay

CAP6938 Neuroevolution and Artificial Embryogeny Approaches to Neuroevolution Dr. Kenneth Stanley February 1, 2006.

Lecture 3 Sorting and Selection. Comparison Sort.

An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.

George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.

Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.

1 A genetic algorithm with embedded constraints – An example on the design of robust D-stable IIR filters 潘欣泰國立高雄大學資工系.

GP FOR ADAPTIVE MARKETS Jake Pacheco 6/11/2010. The Goal  Produce a system that can create novel quantitative trading strategies for the stock market.

Hiba Tariq School of Engineering

IGRASS2011 An Interferometric Coherence Optimization Method Based on Genetic Algorithm in PolInSAR Peifeng Ma, Hong Zhang, Chao Wang, Jiehong Chen Center.

Basics of Genetic Algorithms (MidTerm – only in RED material)

Artificial Intelligence Chapter 4. Machine Evolution

Dr. Kenneth Stanley September 20, 2006

Nature-inspired Robustness Rüdiger W. Brause

Analytical Approach for Soft Error Rate Estimation of SRAM-Based FPGAs

Basics of Genetic Algorithms

Artificial Intelligence Chapter 4. Machine Evolution

Beyond Classical Search

RANDOM NUMBERS SET # 1:

Presentation transcript:

EVOHAR Robustness in Evolved Hardware Jason Masner, John Cavalieri Dr. James Frenzel and Dr. James A. Foster

Acknowledgements This work is funded in part through the Center for Secure and Dependable Software Microelectronics Research and Communications Institute DOD/OST BMDO We are grateful for the help and support of these organizations

Outline Motivation Sorting Networks Tree Representation Linear Representation Intrinsic Representation Error Introduction Some BS Data Future Work

Motivation Study an apparent intrinsic property of evolved systems - ability to degrade gracefully with the presence of local failures. (Robustness for free)

Inputs Sorting Network Output

Inputs Sorting Network Output

Compare Exchange Circuit AND OR 1 0 Input 0 1 Output

CE (1,4) CE (0,4)CE (0,3) CE (1,3)CE (1,2) CE (2,4)CE (0,2) CE (3,4) TREE Structure CE (1,4)CE (0,3)CE (1,3)CE (2,4)CE (0,4) …. ARRAY Structure Individuals

Our Xilinx FPGA Cells ….. 64 Inputs

Tree Crossover 1. Two nodes are randomly chosen on each tree. 2. Nodes and subtrees are swapped.

Tree Crossover 1. Two nodes are randomly chosen on each tree. 2. Nodes and subtrees are swapped.

Tree Crossover 1. Two nodes are randomly chosen on each tree. 2. Nodes and subtrees are swapped.

Tree Mutation 1. Two nodes are randomly chosen. 2. Nodes and subtrees are swapped.

Tree Mutation 1. Two nodes are randomly chosen. 2. Nodes and subtrees are swapped.

Tree Mutation 1. Two nodes are randomly chosen. 2. Nodes and subtrees are swapped.

Representation of Individuals CROSSOVER in Arrays CE (1,4)CE (0,3)CE (1,3)CE (2,4)CE (0,4)CE (2,3)CE (1,4)CE (1,2) CE (0,3)CE (3,4)CE (0,2)CE (1,3)CE (2,3)CE (1,2)CE (0,3)CE (0,1)

Representation of Individuals CROSSOVER in Arrays CE (1,4)CE (0,3)CE (1,3)CE (2,4)CE (0,4)CE (2,3)CE (1,4)CE (1,2) CE (0,3)CE (3,4)CE (0,2)CE (1,3)CE (2,3)CE (1,2)CE (0,3)CE (0,1) CE (1,4)CE (0,3)CE (2,3)CE (1,4)CE (1,2) CE (0,3)CE (3,4) CE (0,2)CE (1,3)CE (2,3) CE (1,2)CE (0,3)CE (0,1)CE (1,3)CE (2,4)CE (0,4)

Representation of Individuals MUTATION in Arrays CE (1,4)CE (0,3)CE (1,3)CE (2,4)CE (0,4)CE (2,3)CE (1,4)CE (1,2)

Representation of Individuals MUTATION in Arrays CE (1,4)CE (0,3)CE (1,3)CE (2,4)CE (0,4)CE (2,3)CE (1,4)CE (1,2) CE (1,4)CE (0,3)CE (1,3)CE (2,4)CE (0,4)CE (2,3)CE (1,4)CE (1,2)

Errors: Pass-Through AND OR 1 0 Input 0 1 Output 1

Error: Stuck on One AND OR 1 0 Input 0 1 Output 1

Error: Stuck on Zero AND OR 1 0 Input 0 1 Output 0

Error Types and Bit Stability Rating Pass-ThroughStuck on ZeroStuck on One MSN Tree Linear * indicate tendency of a bit to survive uncorrupted through a given network with given set of faults. All errors

EVOLUTION BUILDS BETTER CIRCUITS

Future Work Testing on different networks Apply the our BS to different data or problems Hillclimber as a control factor Implement in hardware

Error Types and Bit Stability Value Pass-ThroughStuck on ZeroStuck on One MSN Tree Linear Numbers indicate tendency of a bit to survive uncorrupted through a given network with given set of faults. All errors

Evolutionary Advantages Fast Design Time Less Costly to Develop Generalize Well Evolutionary Circuits are more Robust