Why Asynchronous Parallel Evolution is the Future of Hyper-heuristics: A CDCL SAT Solver Case Study
Evolutionary Algorithms (EAs) are inherently parallel due to their ability to simultaneously evaluate the fitness of individuals. Synchronous Parallel EAs (SPEAs) leverage this with the intent to gain significant speed-ups when executed on multiple processors. However, many important problem classes lead to large variations in fitness evaluation times, such as is often the case in hyper-heuristics where the time complexity of executing one individual may differ greatly from that of another. Asynchronous Parallel EAs (APEAs) omit the generational synchronization step of traditional EAs which work in well-defined cycles. They can provide scalability improvements proportional to the variation in fitness evaluation times of the evolved individuals, and therefore should be considered for use in hyper-heuristics. This paper provides an empirical analysis of the improvements obtained by applying APEAs, compared to SPEAs, on a case study involving the evolution of conflict-driven clause learning Boolean satisfiability solvers, demonstrating that APEAs are the future of hyper-heuristics.
A. R. Bertels and D. R. Tauritz, "Why Asynchronous Parallel Evolution is the Future of Hyper-heuristics: A CDCL SAT Solver Case Study," Proceedings of the Genetic and Evolutionary Computation Conference (2016, New York, NY), pp. 1359-1365, Association for Computing Machinery (ACM), Jul 2016.
The definitive version is available at http://dx.doi.org/10.1145/2908961.2931729
Genetic and Evolutionary Computation Conference (2016: Jul. 20-24, New York, NY)
Center for High Performance Computing Research
Article - Conference proceedings
© 2016 Association for Computing Machinery (ACM), All rights reserved.