[PACT’08][PABA Workshop I] Addressing Churn in P2P EA

This week the first Workshop on Parallel Architerctures and Bioinspired Algorithms is being held in Toronto (Canada) in conjunction with the prestigious conference Parallel Architectures and Compilation Techniques (PACT).

In extension to our line of work in P2P EAs, we have presented the work:

In this paper we analyse the robustness of a Peer-to-Peer (P2P) Evolutionary Algorithm (EA) subject to the following dynamics: peers leave the system independently from each other causing a collective effect known as churn. The algorithm has been designed to tackle large instances of computationally expensive problems and, in this paper, we will assess its behavior under churn. To that end, we have performed a scalability analysis in five different scenarios using the Massively Multimodal Deceptive Problem as a
benchmark.  In all cases, the P2P EA reaches the success criterion without a penalty on the response time. The key to the algorithm robustness is to ensure enough peers at the beginning of the experiment. Some of them leave but those that remain are enough to guarantee a reliable  convergence.

Google AppEngine

Mientras que algunos abogan porque le peguemos un tajo al cable o un soplido a la WiFi y nos desconectemos de la Internet, aquí nos interesa ver cómo podemos aprovechar infraestructura existente para hacer computación masivamente paralela sin necesidad de grandes instalaciones, así que hoy me he preparado un mini-tutorial del Google AppEngine basado en el Getting Started guide, y he subido mi propia aplicación a AppSpot, para el efecto final.
Es una opción de hosting de aplicaciones muy interesante, y tiene potencial tanto como back-engine como usándolo simplemente de motor de aplicaciones. Así que en el futuro, haremos alguna cosa con él, seguramente.