A Method to Minimize Distributed PSO Algorithm Execution Time in Grid Computer Environment

  • Authors:
  • F. Parra;S. Garcia Galan;A. J. Yuste;R. P. Prado;J. E. Muñoz

  • Affiliations:
  • Dpt. of Telecomunication Engineering, Alfonso X el Sabio, Universidad de Jaen, Linares, Spain 28 23200;Dpt. of Telecomunication Engineering, Alfonso X el Sabio, Universidad de Jaen, Linares, Spain 28 23200;Dpt. of Telecomunication Engineering, Alfonso X el Sabio, Universidad de Jaen, Linares, Spain 28 23200;Dpt. of Telecomunication Engineering, Alfonso X el Sabio, Universidad de Jaen, Linares, Spain 28 23200;Dpt. of Telecomunication Engineering, Alfonso X el Sabio, Universidad de Jaen, Linares, Spain 28 23200

  • Venue:
  • IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part II: Bioinspired Applications in Artificial and Natural Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a method to minimize distributed PSO algorithm execution time in a grid computer environment, based on a reduction in the information interchanged among the demes involved in the process of finding the best global fitness solution. Demes usually interchange the best global fitness solution they found at each iteration. Instead of this, we propose to interchange information only after an specified number of iterations are concluded. By applying this technique, it is possible to get a very significant execution time decrease without any loss of solution quality.