, Volume 35, Issue 1, pp 33-61
Date: 02 Dec 2006

Memetic Algorithms for Parallel Code Optimization

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.