Integrating Software Distributed Shared Memory and Message Passing Programming

被引:0
|
作者
Wong, H. J. [1 ]
Rendell, A. P. [1 ]
机构
[1] Australian Natl Univ, Dept Comp Sci, Canberra, ACT, Australia
基金
澳大利亚研究理事会;
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Software Distributed Shared Memory (SDSM) systems pro-tide programmers with a shared memory programming environment across distributed memory architectures. In contrast to the message passing programming environment, the SDSM can resolve data dependencies within the application without the programmer having to explicitly specify communication. However, this service is provided at a cost to performance. Thus it makes sense to use message passing directly when data dependencies are easy to solve using message passing. For example, it is not complicated to specify data transfer for large contiguous regions of memory. This paper outlines how the Danui SDSM library has been extended to include support for message passing. Four different message passing transfers are identified depending on whether the data being sent/received resides in private or globally shared buffers. Transfers between globally shared buffers are further categorized as symmetrical or asymmetrical depending on whether they correspond to the same region of shared memory. The implication of each transfer type on the memory consistency of the global address space is discussed. Central to the Danui SDSM extension is the use of information provided and implied by message passing operations. The overhead of the implementation is analyzed.
引用
收藏
页码:197 / +
页数:2
相关论文
共 50 条
  • [31] Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks
    Shlomi Dolev
    Thomas Petig
    Elad M. Schiller
    Algorithmica, 2023, 85 : 216 - 276
  • [32] Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks
    Dolev, Shlomi
    Petig, Thomas
    Schiller, Elad M.
    ALGORITHMICA, 2023, 85 (01) : 216 - 276
  • [33] A coded shared atomic memory algorithm for message passing architectures
    Viveck R. Cadambe
    Nancy Lynch
    Muriel Mèdard
    Peter Musial
    Distributed Computing, 2017, 30 : 49 - 73
  • [34] Relating Message Passing and Shared Memory, Proof-Theoretically
    Pfenning, Frank
    Pruiksma, Klaas
    COORDINATION MODELS AND LANGUAGES, COORDINATION 2023, 2023, 13908 : 3 - 27
  • [35] A coded shared atomic memory algorithm for message passing architectures
    Cadambe, Viveck R.
    Lynch, Nancy
    Medard, Muriel
    Musial, Peter
    DISTRIBUTED COMPUTING, 2017, 30 (01) : 49 - 73
  • [36] Comparison of message passing interface and hybrid programming models to solve pressure equation in distributed memory system
    Jeon, Byoung Jin
    Choi, Hyoung Gwon
    Transactions of the Korean Society of Mechanical Engineers, B, 2015, 39 (02) : 191 - 197
  • [37] Distributed shared arrays: An integration of message passing and multithreading on SMP clusters
    Basharahil, R
    Wims, B
    Xu, CZ
    Fu, S
    JOURNAL OF SUPERCOMPUTING, 2005, 31 (02): : 161 - 184
  • [38] Distributed Shared Arrays: An Integration of Message Passing and Multithreading on SMP Clusters
    Ramzi Basharahil
    Brian Wims
    Cheng-Zhong Xu
    Song Fu
    The Journal of Supercomputing, 2005, 31 : 161 - 184
  • [39] From shared to distributed memory: Converting non-numeric parallel algorithms to Message Passing Interface (MPI)
    Breshears, CP
    THIRTIETH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, VOL 1: SOFTWARE TECHNOLOGY AND ARCHITECTURE, 1997, : 209 - 210
  • [40] Shared Memory vs. Message Passing: The COMOPS Benchmark Experiment
    Yong Luo
    The Journal of Supercomputing, 1999, 13 : 283 - 301