On the Design of a Master-Worker Adaptive Algorithm Selection Framework

Abstract : We investigate the design of a master-worker schemes for adaptive algorithm selection with the following two-fold goal: (i) choose accurately from a given portfolio a set of operators to be executed in parallel, and consequently (ii) take full advantage of the compute power offered by the underlying distributed environment. In fact, it is still an open issue to design online distributed strategies that are able to optimally assign operators to parallel compute resources when distributively solving a given optimization problem. In our proposed framework, we adopt a reward-based perspective and investigate at what extent the average or maximum rewards collected at the master from the workers are appropriate. Moreover, we investigate the design of both homogeneous and heterogeneous scheme. Our comprehensive experimental study, conducted through a simulation-based methodology and using a recently proposed benchmark family for adaptive algorithm selection, reveals the accuracy of the proposed framework while providing new insights on the performance of distributed adaptive optimization algorithms.
Type de document :
Communication dans un congrès
EA 2017 - 13th International Conference on Artificial Evolution, Oct 2017, Paris, France. Springer, EA 2017: Artificial Evolution, 10764, pp.1-15, 2018, LNCS. 〈10.1007/978-3-319-78133-4_1〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01643354
Contributeur : Christopher Jankee <>
Soumis le : mardi 21 novembre 2017 - 13:15:41
Dernière modification le : vendredi 22 mars 2019 - 01:36:10

Identifiants

Collections

Citation

Christopher Jankee, Sébastien Verel, Cyril Fonlupt, Bilel Derbel. On the Design of a Master-Worker Adaptive Algorithm Selection Framework. EA 2017 - 13th International Conference on Artificial Evolution, Oct 2017, Paris, France. Springer, EA 2017: Artificial Evolution, 10764, pp.1-15, 2018, LNCS. 〈10.1007/978-3-319-78133-4_1〉. 〈hal-01643354〉

Partager

Métriques

Consultations de la notice

246