Optimizing a parameterized message-passing metaheuristic scheme on a heterogeneous cluster

被引:0
|
作者
José-Matías Cutillas-Lozano
Domingo Giménez
机构
[1] University of Murcia,Departamento de Informática y Sistemas
来源
Soft Computing | 2017年 / 21卷
关键词
Parameterized metaheuristic schemes; Parallel metaheuristics; Message-passing metaheuristic schemes; Heterogeneous computing; Auto-tuning;
D O I
暂无
中图分类号
学科分类号
摘要
This paper studies the development of message-passing parameterized schemes of metaheuristics and the use of auto-tuning techniques to optimize their execution time. Previous parameterized schemes on shared-memory are extended with new metaheuristic-parallelism parameters representing the migration frequency, the size of the migration and the number of processes. An optimization Problem of Electricity Consumption in Exploitation of Wells is used as test case. Experimental results in heterogeneous systems are reported for this problem, and the influence of the parallelism parameters is studied. The message-passing scheme proves to be preferable to the shared-memory scheme in terms of execution time, giving similar results for the goodness of the solutions. In the executions in a heterogeneous cluster, the best experimental results are obtained in terms of speed-up and quality of the solution by mapping a number of processes close to the value of the population size, and considering the relative speeds of the components of the heterogeneous system. Furthermore, optimized execution times can be achieved with auto-tuning techniques based on theoretical–empirical models of the execution time.
引用
收藏
页码:5557 / 5572
页数:15
相关论文
共 50 条
  • [21] Combinators for Message-Passing in Haskell
    Brown, Neil C. C.
    PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, 2011, 6539 : 19 - 33
  • [22] Informed Lifting for Message-Passing
    Kersting, Kristian
    El Massaoudi, Youssef
    Ahmadi, Babak
    Hadiji, Fabian
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 1181 - 1186
  • [23] Ordered subsets message-passing
    O'Sullivan, JA
    Singla, N
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 349 - 349
  • [24] Message-passing environments for metacomputing
    Brune, MA
    Fagg, GE
    Resch, MM
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 1999, 15 (5-6): : 699 - 712
  • [25] Convolutional Approximate Message-Passing
    Takeuchi, Keigo
    IEEE SIGNAL PROCESSING LETTERS, 2020, 27 (27) : 416 - 420
  • [26] A message-passing algorithm with damping
    Pretti, M
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2005, : 165 - 179
  • [27] AN OVERVIEW OF MESSAGE-PASSING ENVIRONMENTS
    MCBRYAN, OA
    PARALLEL COMPUTING, 1994, 20 (04) : 417 - 444
  • [28] THE NX MESSAGE-PASSING INTERFACE
    PIERCE, P
    PARALLEL COMPUTING, 1994, 20 (04) : 463 - 480
  • [29] Probabilistic Message-Passing Control
    Herzallah, Randa
    Lowe, David
    Qarout, Yazan
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (07): : 4470 - 4482
  • [30] A CHARACTERIZATION OF ASYNCHRONOUS MESSAGE-PASSING
    GOREGAOKAR, SR
    ARUNKUMAR, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 241 : 270 - 287