%0 Journal Article %1 MereloMoraFernandesEsparcia13 %A Merelo, J. J. %A Mora, A. M. %A Fernandes, C. M. %A Esparcia-Alcázar, AnnaI %B Natural Computing %D 2013 %I Springer Netherlands %J Natural Computing %K citas, citeulike javascript, parasitic, referencias %N 2 %P 149--162 %R 10.1007/s11047-012-9338-5 %T Designing and testing a pool-based evolutionary algorithm %U http://dx.doi.org/10.1007/s11047-012-9338-5 %V 12 %X This paper focuses on the iterative design of SofEA , an architecture for distributing evolutionary algorithms (EAs) across computer networks in an asynchronous and decentralized way. SofEA is based on a pool architecture implemented on an object store, allowing the asynchronous interaction with which several clients. The fact that each client is autonomous leads to complex behavior, which will be examined in the work, so that the design can be validated, rules of thumb can be extracted, and the limits of scalability can be found. In this paper we advance the design of an asynchronous, fault-tolerant, and hopefully scalable distributed EA based on the object store CouchDB. We do so by iteratively analyzing running time and average evaluations to solutions on increasingly better versions of the algorithm, looking for the best results, at least from the point of view of running time. By doing so, we increase speed almost fourfold, and also decrement the average number of evaluations to solution in some cases. Experiments have shown also which critical parameters have the bigger influence on the performance in this kind of systems: live population size and number of conflicts, with both being influenced by the number of clients and the size of the population block each client handles at a time. These experiments also show that there is a balance between scalability and fault tolerance, with scalability dropping when a certain number of clients is reached; further clients only increase fault tolerance, at least in the configurations we are using in this paper. The paper also shows that experimentation and measurement conform a good methodology for the design of this kind of asynchronous, heterogeneous and distributed systems, where analytic performance prediction is almost impossible.

@article{MereloMoraFernandesEsparcia13, abstract = {{This paper focuses on the iterative design of SofEA , an architecture for distributing evolutionary algorithms (EAs) across computer networks in an asynchronous and decentralized way. SofEA is based on a pool architecture implemented on an object store, allowing the asynchronous interaction with which several clients. The fact that each client is autonomous leads to complex behavior, which will be examined in the work, so that the design can be validated, rules of thumb can be extracted, and the limits of scalability can be found. In this paper we advance the design of an asynchronous, fault-tolerant, and hopefully scalable distributed EA based on the object store CouchDB. We do so by iteratively analyzing running time and average evaluations to solutions on increasingly better versions of the algorithm, looking for the best results, at least from the point of view of running time. By doing so, we increase speed almost fourfold, and also decrement the average number of evaluations to solution in some cases. Experiments have shown also which critical parameters have the bigger influence on the performance in this kind of systems: live population size and number of conflicts, with both being influenced by the number of clients and the size of the population block each client handles at a time. These experiments also show that there is a balance between scalability and fault tolerance, with scalability dropping when a certain number of clients is reached; further clients only increase fault tolerance, at least in the configurations we are using in this paper. The paper also shows that experimentation and measurement conform a good methodology for the design of this kind of asynchronous, heterogeneous and distributed systems, where analytic performance prediction is almost impossible.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Merelo, J. J. and Mora, A. M. and Fernandes, C. M. and Esparcia-Alc\'{a}zar, AnnaI}, biburl = {https://www.bibsonomy.org/bibtex/2a3cd46bbefe7b9eb2e8cac16be34cbb0/fernand0}, booktitle = {Natural Computing}, citeulike-article-id = {11293083}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11047-012-9338-5}, citeulike-linkout-1 = {http://www.springerlink.com/content/03504k1t58h0u456}, citeulike-linkout-2 = {http://link.springer.com/article/10.1007/s11047-012-9338-5}, day = 19, doi = {10.1007/s11047-012-9338-5}, interhash = {04400cb786faecf1bc307965ac37079f}, intrahash = {a3cd46bbefe7b9eb2e8cac16be34cbb0}, issn = {1567-7818}, journal = {Natural Computing}, keywords = {citas, citeulike javascript, parasitic, referencias}, month = sep, number = 2, pages = {149--162}, posted-at = {2016-08-31 17:59:04}, priority = {2}, publisher = {Springer Netherlands}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Designing and testing a pool-based evolutionary algorithm}}, url = {http://dx.doi.org/10.1007/s11047-012-9338-5}, volume = 12, year = 2013 }