Dynamic load balancing of distributed SPMD computations with explicit message-passing

被引:0
|
作者
Cermele, M
Colajanni, M
Necci, G
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Distributed systems have the potentiality of becoming an alternative platform for parallel computations. However, there are still many obstacles to overcome, one of the most serious is that distributed systems typically consist of shared heterogeneous components with highly variable computational power. In this paper we present a load balancing support that checks the load status and, if necessary, adapts the workload to dynamic platform conditions through data migrations from overloaded to underloaded nodes. Unlike task migration supports for task parallelism and other data migration frameworks for master/slave-based parallel applications, our support works for the entire class of SPMD regular applications with explicit communications such as linear algebra problems, partial differential equation solvers, image processing algorithms. Although we considered several variants (three activation mechanisms, three load monitoring techniques and four decision policies), we implemented only the protocols that guarantee program consistency. The efficiency of the strategies is tested in the instance of two SPMD algorithms that are based on the PVM library enriched by special-purpose primitives for data management. As additional contribution, our research keeps the entire support for dynamic load balancing transparent to the programmer. Even if the technical details are out of the scope of this paper, we point out that the only visible interface of our support is the activation phase.
引用
收藏
页码:2 / 16
页数:15
相关论文
共 50 条
  • [1] HEURISTIC METHODS FOR DYNAMIC LOAD BALANCING IN A MESSAGE-PASSING MULTICOMPUTER
    XU, J
    HWANG, K
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1993, 18 (01) : 1 - 13
  • [2] Performance modeling for SPMD message-passing programs
    Brehm, J
    Worley, PH
    Madhukar, M
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1998, 10 (05): : 333 - 357
  • [3] Dynamic Tree Switching for Distributed Message-Passing Applications
    Chakraborty, Suchetana
    Chakraborty, Sandip
    Karmakar, Sushanta
    Nandi, Sukumar
    JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2015, 23 (01) : 1 - 40
  • [4] Dynamic Tree Switching for Distributed Message-Passing Applications
    Suchetana Chakraborty
    Sandip Chakraborty
    Sushanta Karmakar
    Sukumar Nandi
    Journal of Network and Systems Management, 2015, 23 : 1 - 40
  • [5] Charon message-passing toolkit for scientific computations
    Van der Wijngaart, RF
    HIGH PERFORMANCE COMPUTING - HIPC 2000, PROCEEDINGS, 2001, 1970 : 3 - 14
  • [6] Scalable CFD computations using message-passing and distributed shared memory algorithms
    Plazek, J
    Banas, K
    Kitowski, J
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, PROCEEDINGS, 2000, 1908 : 282 - 288
  • [7] A load balancing of O(NlogN) N-body algorithm on message-passing architectures
    Meajil, AI
    PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS - PROCEEDINGS OF THE ISCA 9TH INTERNATIONAL CONFERENCE, VOLS I AND II, 1996, : 378 - 383
  • [8] Distributed Breakpoint Detection in Message-Passing Programs
    De, Drummond, L. M. A.
    Barbosa, V. C.
    Journal of Parallel and Distributed Computing, 39 (02):
  • [9] Message-Passing Algorithms for the Verification of Distributed Protocols
    Jezequel, Loig
    Esparza, Javier
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION: (VMCAI 2014), 2014, 8318 : 222 - 241
  • [10] Explicit Message-Passing Heterogeneous Graph Neural Network
    Xu, Lei
    He, Zhen-Yu
    Wang, Kai
    Wang, Chang-Dong
    Huang, Shu-Qiang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (07) : 6916 - 6929