1 / 27

EVOHAR

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.

lucia
Download Presentation

EVOHAR

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. 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

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

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

  5. Sorting Network Inputs Output 0 0 0 0 1 0 1 0 0 1 1 1 1 1 0 1 0 1 1 1

  6. Sorting Network Inputs Output 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1

  7. Compare Exchange Circuit 1 AND 0 OR 1 0 Input Output

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

  9. Our Xilinx FPGA Inputs 0 0 1 0 1 1 0 1 Cells ….. 64 Cells ….. 64

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

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

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

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

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

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

  16. 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)

  17. 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 (0,2) CE (1,3) CE (2,3) CE (2,3) CE (1,4) CE (1,2) CE (0,3) CE (3,4) CE (1,3) CE (2,4) CE (0,4) CE (1,2) CE (0,3) CE (0,1)

  18. 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)

  19. 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 (2,3) CE (1,3) CE (2,4) CE (0,4) CE (0,3) CE (1,4) CE (1,2)

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

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

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

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

  24. EVOLUTION BUILDS BETTER CIRCUITS

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

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

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

More Related