evohar robustness in evolved hardware jason masner, john cavalieri dr. james frenzel and dr. james...
Post on 19-Dec-2015
216 views
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)
InputsSorting Network
Output
0
1
1
0
0
1
1
0
0
1
0
1
0
1
1
1 1
1
0
0
InputsSorting Network
Output
1
0
1
1
1
0
1
1
1
0
1
1
1 1
1
1
0
1
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
Cel
ls …
.. 64
Inputs
0
1
1
0
0
0
1
1
Tree Crossover1. Two nodes are randomly chosen on each tree.2. Nodes and subtrees are swapped.
Tree Crossover1. Two nodes are randomly chosen on each tree.2. Nodes and subtrees are swapped.
Tree Crossover1. Two nodes are randomly chosen on each tree.2. Nodes and subtrees are swapped.
Tree Mutation1. Two nodes are randomly chosen.2. Nodes and subtrees are swapped.
Tree Mutation1. Two nodes are randomly chosen.2. Nodes and subtrees are swapped.
Tree Mutation1. 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-Through Stuck on Zero Stuck on One
MSN
Tree
Linear
* indicate tendency of a bit to survive uncorruptedthrough 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-Through Stuck on Zero Stuck on One
MSN
Tree
Linear
Numbers indicate tendency of a bit to survive uncorruptedthrough a given network with given set of faults.
0.968 0.958 0.958 0.9610.971 0.962 0.961 0.9680.969 0.961 0.964 0.966
All errors
Evolutionary Advantages
• Fast Design Time
• Less Costly to Develop
• Generalize Well
• Evolutionary Circuits are more Robust