Memetic algorithms for parallel code optimization

DOI10.1007/S10766-006-0026-XzbMath1112.68501OpenAlexW1543127209WikidataQ60568795 ScholiaQ60568795MaRDI QIDQ878115

Esin Onbaşioğlu, Ender Özcan

Publication date: 26 April 2007

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10766-006-0026-x

zbMATH Keywords

parallelizing compilerssearch methodsmemetic algorithmsDistributed memory parallel computers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• The dynamics of a genetic algorithm for simple random Ising systems
• Communication-free hyperplane partitioning of nested loops
• Optimization of data distribution and processor allocation problem using simulated annealing
• A study on the use of ``self-generation in memetic algorithms
• Deriving array distributions by optimization techniques
• A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers)

This page was built for publication: Memetic algorithms for parallel code optimization