BloJJ

Adventures of a multidimensional freak

This is Juan Julián Merelo Guervós English-language blog. He teaches computer science at the University of Granada, in southern Spain. Come back here to read about politics, technology, with a new twist

Latest comments

  • useful link en Problem solved: disabled wireless Internet
  • go here en Compute the number of cites in Google Citations
  • Nick en The fall of the empire bridge
  • Juan Walters en Books unbound
  • CharlesJensen en Googlespread
  • divya en In EvoStar
  • ufabet en About conference poster design and defense
  • Linker SEO en About conference poster design and defense
  • game killer uptodown en What is informal distributed evolutionary computation?
  • game killer uptodown en What is informal distributed evolutionary computation?
  • Blogs Out There

    Nelson Minar's Blog
    Jeremy Zawodny's Blog
    Kottke
    Complexes, Carlos Gershenson's blog
    IlliGAL, Genetic Algorithms blog
    Blogging in the wind, Víctor R. Ruiz's blog


    Atalaya, my Spanish language blog
    Geneura@Wordpress, our research group's blog.
    My home page

    Old stories


    Creative Commons License
    This work is licensed under a Creative Commons License.
    Blogalia

    Stats
    Inicio > Historias > New paper on distributed evolutionary computation uploaded to ArXiV

    New paper on distributed evolutionary computation uploaded to ArXiV

    I uploaded a couple of days our paper Self-adaptive Gossip Policies for Distributed Population-based Algorithms, which is a collaboration among a bunch of researchers from 4 different institutions trying to come up with the perfect algorithms that is able to extract all the juice from heterogeneous, peer to peer, dynamic, networks. Here's the abstract:
    Gossipping has demonstrate to be an efficient mechanism for spreading information among P2P networks. Within the context of P2P computing, we propose the so-called Evolvable Agent Model for distributed population-based algorithms which uses gossipping as communication policy, and represents every individual as a self-scheduled single thread. The model avoids obsolete nodes in the population by defining a self-adaptive refresh rate which depends on the latency and bandwidth of the network. Such a mechanism balances the migration rate to the congestion of the links pursuing global population coherence. We perform an experimental evaluation of this model on a real parallel system and observe how solution quality and algorithm speed scale with the number of processors with this seamless approach.

    2007-03-27 12:13 | 0 Comment(s) | Filed in

    Referencias (TrackBacks)

    URL de trackback de esta historia http://blojj.blogalia.com//trackbacks/48266

    Comentarios

    Nombre
    Correo-e
    URL
    Dirección IP: 54.224.11.137 (142405f561)
    Comentario
    ¿Cuánto es: diez mil + uno?

    © 2002 - 2008 jmerelo
    Powered by Blogalia