MParCO: A Minimalist Parallel Framework for Combinatorial Optimization Applications
Resumen
This paper addresses the exploration of the potential of distributed parallelism in combinatorial optimization applications through a minimalist approach. In contrast to several parallel frameworks proposed in the last decades, specialized in parallelizing classical methods such as Branch-and-Bound and well-known metaheuristics, we propose a framework, so-called MParCO, that focuses essentially on assuring asynchronism, an essential ingredient for the performance of enumerative methods for combinatorial optimization problems.
Publicado
2018-10-01
Cómo citar
DANTAS, Allberson B. de O.; CORRÊA, Ricardo C.; DE VASCONCELOS, Lucas B..
MParCO: A Minimalist Parallel Framework for Combinatorial Optimization Applications.
Anais do Simpósio em Sistemas Computacionais de Alto Desempenho (SSCAD), [S.l.], p. 243-251, oct. 2018.
ISSN 0000-0000.
Disponible en: <https://sol.sbc.org.br/index.php/sscad/article/view/15668>. Fecha de acceso: 17 mayo 2024
Sección
Artigos Completos