P2 pgp evostar

843 views
739 views

Published on

Presentation of A Peer-to-Peer Approach to Genetic Programming, by Laredo, Lombraña, Fernández de Vega, Arenas and Merelo

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
843
On SlideShare
0
From Embeds
0
Number of Embeds
187
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • Picture by Taivasalla http://www.flickr.com/photos/taivasalla/2306087602/
  • Picture from Jason Samfield, http://www.flickr.com/photos/jason-samfield/5246071784/
  • Picture “The great Escape”, by TanakaWho http://www.flickr.com/photos/28481088@N00/3817317092/
  • Picture taken from http://www.flickr.com/photos/picsoflife/4696497459/lightbox/
  • Picture taken from http://www.flickr.com/photos/picsoflife/4696497459/lightbox/
  • P2 pgp evostar

    1. 1. A Peer-to-Peer Approach to Genetic Programming Juan Luis Jiménez Laredo, Daniel Lombraña González, Francisco Fernández de Vega, Maribel García Arenas, Juan Julián Merelo Guervós University of Granada (1,4,5) University of Extremadura (2,3) http://geneura.wordpress.com http://twitter.com/geneura
    2. 2. Peer to Peer in 2 minutes
    3. 3. Why P2P? <ul><li>Gather more computing nodes.
    4. 4. Avoid single point of failure.
    5. 5. Test on more natural computing substrates. </li></ul>
    6. 6. Why not P2P? <ul><li>High churn.
    7. 7. Unknown topology.
    8. 8. Wide performance ranges. </li></ul>
    9. 9. Can we adapt genetic programming to a P2P environment?
    10. 10. Short answer: Yes
    11. 11. But here's the long answer Using the Evolvable Agent model: J.L.J. Laredo, P.A. Castillo, A.M. Mora, and J.J. Merelo. Exploring population structures for locally concurrent and massively parallel evolutionary algorithms . In IEEE Congress on Evolutionary Computation (CEC2008), WCCI2008 Proceedings, pages 2610–2617. IEEE Press, Hong Kong, June 2008. http://lugl.info/xiQP
    12. 12. Meet the (evolvable) agent <ul><li>Spatially structured Evolutionary Algorithm
    13. 13. Every agent schedules a single individual
    14. 14. Neighborhood self-organized via newscast protocol </li><ul><li>More on this later </li></ul><li>Basic implementation: Agent == Thread </li></ul>
    15. 15. Newscast: Gossip protocol Joining: connecting to an existing node. Leaving: stop communication Emergent small world graph structure Fault tolerance Graceful degradation
    16. 16. Newscast: Cache size 4 4 3 1 2 1 2 3 3 4 1 2 3 4 1 2 3 4
    17. 17. Experimental setup <ul><li>Simulated P2P environment
    18. 18. Well known GP problems </li><ul><li>11 bit multiplexer: 11M
    19. 19. Even parity 5: EP5 </li></ul><li>Source available at: </li></ul>http://forja.rediris.es/svn/geneura/peerevogen Check paper for GP parameters
    20. 20. Results
    21. 21. Concluding <ul>Parallel execution of GP using EvAg implies improvement in times to solution. </ul>
    22. 22. Thanks for your attention. Any question? (Check/download presentation at http://geneura.wordpress.com )

    ×