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 条
  • [41] MESSAGE-PASSING INTERFACES - SPECIAL ISSUE
    HEMPEL, R
    HEY, AJG
    MCBRYAN, O
    WALKER, DW
    PARALLEL COMPUTING, 1994, 20 (04) : 415 - 416
  • [42] A message-passing solver for linear systems
    Shental, Ori
    Bickson, Danny
    Siegel, Paul H.
    Wolf, Jack K.
    Dolev, Danny
    2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 403 - 403
  • [43] Experiments with migration of message-passing tasks
    Iskra, KA
    Hendrikse, ZW
    van Albada, GD
    Overeinder, BJ
    Sloot, PMA
    Gehring, J
    GRID COMPUTING - GRID 2000, PROCEEDINGS, 2001, 1971 : 203 - 213
  • [44] A Message-Passing Interpretation of Adjoint Logic
    Pruiksma, Klaas
    Pfenning, Frank
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (291): : 60 - 79
  • [45] Message-Passing Algorithms: Reparameterizations and Splittings
    Ruozzi, Nicholas
    Tatikonda, Sekhar
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (09) : 5860 - 5881
  • [46] Clustering Phenomena in Message-Passing Schemes
    Tatikonda, Sekhar
    ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY, 2009, : 10 - 12
  • [47] Managing flocking objects with an octree spanning a parallel message-passing computer cluster
    Portegys, TE
    Greenan, KM
    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 683 - 687
  • [48] HMF: High-available Message-passing Framework for Cluster File System
    Yang, Dong
    Chen, Zhuan
    Tang, Rongfeng
    Xiong, Jin
    Meng, Dan
    NAS: 2009 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE, 2009, : 249 - 252
  • [49] The effects of pipelined communication in message-passing
    Moritz, CA
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 13TH INTERNATIONAL CONFERENCE ON COMPUTERS AND THEIR APPLICATIONS, 1998, : 401 - 406
  • [50] Specialization of CML message-passing primitives
    Reppy, John
    Xiao, Yingqi
    CONFERENCE RECORD OF POPL 2007: THE 34TH ACM SIGPLAN SIGACT SYMPOSIUM ON PRINCIPLES OF PROGAMMING LANGUAGES, 2007, : 315 - 326