Cloud-based evolutionary algorithms: An algorithmic study

  • Authors:
  • K. Meri;M. G. Arenas;A. M. Mora;J. J. Merelo;P. A. Castillo;P. García-Sánchez;J. L. Laredo

  • Affiliations:
  • GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain;GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain;GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain;GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain;GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain;GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain;GeNeura Department of Architecture and Computer Technology, ETSIIT-CITIC, University of Granada, Granada, Spain

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a cloud-computing based evolutionary algorithm using a synchronous storage service as pool for exchange information among population of solutions. The multi-computer was composed of several normal PCs or laptops connected via Wifi or Ethernet. In this work the effect of how the distributed evolutionary algorithm reached the solution when new PCs was added was tested whether that effect also translates to the algorithmic performance of the algorithm. To this end different (and hard) problems was addressed using the proposed multi-computer, analyzing the effects that the automatic load-balancing and synchronization had on the speed of algorithm successful, and analyzing how the number of evaluation per second increases when the multi-computer includes new nodes. The measure used for the analysis was number of evaluation per second which was increased when the multi-computer includes new nodes. The algorithm solved the proposed problems and it was viable to run it in homogeneous or heterogeneous platforms. The experiments includes two problems and different configuration for the distributed evolutionary algorithm in order to check the results of the algorithm for several rates of information exchange with the selected storage service. Results shows that the system is viable with homogeneous or heterogeneous nodes and there is no significative differences for the synchronous storage services we have tested. But when the problem is harder, and the threads of the algorithm does not stop for each information exchange (migration of individual from one population to another one), the differences of using a specific service became significative in terms of success of the algorithm.