It's Not a Bug, It's a Feature. Wait-free ...
Document type :
Communication dans un congrès avec actes
Title :
It's Not a Bug, It's a Feature. Wait-free Asynchronous Cellular Genetic Algorithm
Author(s) :
Dorronsoro, Bernabé [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Pinel, Frederic [Auteur]
Faculty of Science, Technology and Communication [Luxembourg] [FSTC]
Bouvry, Pascal [Auteur]
Faculty of Science, Technology and Communication [Luxembourg] [FSTC]
Khan, Samee Ullah [Auteur]
Department of Electrical and Computer Engineering [Fargo]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Pinel, Frederic [Auteur]
Faculty of Science, Technology and Communication [Luxembourg] [FSTC]
Bouvry, Pascal [Auteur]
Faculty of Science, Technology and Communication [Luxembourg] [FSTC]
Khan, Samee Ullah [Auteur]
Department of Electrical and Computer Engineering [Fargo]
Conference title :
PPAM 2013 - 10th International Conference on Parallel Processing and Applied Mathematics
City :
Warsaw
Country :
Pologne
Start date of the conference :
2013-09-08
Book title :
LNCS
Journal title :
PPAM 2013: Parallel Processing and Applied Mathematics
Publisher :
Springer
Publication date :
2013-09-16
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [en]
In this paper, we simplify a Parallel Asynchronous Cellular Genetic Algorithm, by removing thread locks for shared memory access. This deliberate error aims to accelerate the algorithm, while preserving its search capability. ...
Show more >In this paper, we simplify a Parallel Asynchronous Cellular Genetic Algorithm, by removing thread locks for shared memory access. This deliberate error aims to accelerate the algorithm, while preserving its search capability. Experiments with three benchmark problems show an acceleration, and even a slight improvement in search capability, with statistical significance.Show less >
Show more >In this paper, we simplify a Parallel Asynchronous Cellular Genetic Algorithm, by removing thread locks for shared memory access. This deliberate error aims to accelerate the algorithm, while preserving its search capability. Experiments with three benchmark problems show an acceleration, and even a slight improvement in search capability, with statistical significance.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- http://sameekhan.org/pub/P_K_2013_PPAM.pdf
- Open access
- Access the document