A high-efficient multi-deme genetic algorithm with better load-balance (Q2224284)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7305539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A high-efficient multi-deme genetic algorithm with better load-balance |
scientific article; zbMATH DE number 7305539 |
Statements
A high-efficient multi-deme genetic algorithm with better load-balance (English)
0 references
3 February 2021
0 references
Summary: Genetic algorithm is a very powerful search algorithm that fits for many complex situations. However, it is very time consuming, which limits its usage. Previous work which makes use of multi-core systems to parallelise it performs well and gains much attention. This paper introduces that the load-imbalance problem in parallel genetic algorithm will incur large overhead and will limit the performance. We propose two efficient mechanisms (postponed waiting and work stealing) to achieve fine-grained schedule to solve the problem. Compared with traditional multi-deme parallel genetic algorithm, our high-efficient multi-deme genetic algorithm (HMGA) can achieve an average speedup of 1.36.
0 references
genetic algorithm
0 references
multi-deme genetic algorithm (MGA)
0 references
load imbalance
0 references
fine-grained schedule
0 references
0.7499315142631531
0 references
0.7440619468688965
0 references
