International Journal of Parallel Programming

, Volume 35, Issue 1, pp 33–61

Memetic Algorithms for Parallel Code Optimization

Article

DOI: 10.1007/s10766-006-0026-x

Cite this article as:
Özcan, E. & Onbaşioğlu, E. Int J Parallel Prog (2007) 35: 33. doi:10.1007/s10766-006-0026-x

Discovering the optimum number of processors and the distribution of data on distributed memory parallel computers for a given algorithm is a demanding task. A memetic algorithm (MA) is proposed here to find the best number of processors and the best data distribution method to be used for each stage of a parallel program. Steady state memetic algorithm is compared with transgenerational memetic algorithm using different crossover operators and hill-climbing methods. A self-adaptive MA is also implemented, based on a multimeme strategy. All the experiments are carried out on computationally intensive, communication intensive, and mixed problem instances. The MA performs successfully for the illustrative problem instances.

Keywords

Distributed memory parallel computers memetic algorithms parallelizing compilers search methods 

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  1. 1.Bilgisayar Muhendisligi Bolumu, Inonu Mah. KAYISDAGI Cad.Yeditepe UniversitesiKadikoy/IstanbulTurkey

Personalised recommendations