WHERE IS TIME SPENT IN MESSAGE-PASSING AND SHARED-MEMORY PROGRAMS

被引:0
|
作者
CHANDRA, S [1 ]
LARUS, JR [1 ]
ROGERS, A [1 ]
机构
[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544
来源
SIGPLAN NOTICES | 1994年 / 29卷 / 11期
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Message passing and shared memory are two techniques parallel programs use for coordination and communication. This paper studies the strengths and weaknesses of these two mechanisms by comparing equivalent, well-written message-passing and shared-memory programs running on similar hardware. To ensure that our measurements are comparable, we produced two carefully tuned versions of each program and measured them on closely-related simulators of a message-passing and a shared-memory machine, both of which are based on same underlying hardware assumptions. We examined the behavior and performance of each program carefully. Although the cost of computation in each pair of programs was similar, synchronization and communication differed greatly. We found that message-passing's advantage over shared-memory is not clear-cut. Three of the four shared-memory programs ran at roughly the same speed as their message-passing equivalent, even though their communication patterns were different.
引用
下载
收藏
页码:61 / 73
页数:13
相关论文
共 50 条
  • [31] Performance modeling for SPMD message-passing programs
    Brehm, J
    Worley, PH
    Madhukar, M
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1998, 10 (05): : 333 - 357
  • [32] Bounded phase analysis of message-passing programs
    Bouajjani, Ahmed
    Emmi, Michael
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2014, 16 (02) : 127 - 146
  • [33] Effpi: Verified Message-Passing Programs in Dotty
    Scalas, Alceste
    Yoshida, Nobuko
    Benussi, Elias
    SCALA'19: PROCEEDINGS OF THE 10TH ACM SIGPLAN INTERNATIONAL SYMPOSIUM ON SCALA, 2019, : 27 - 31
  • [34] Bounded phase analysis of message-passing programs
    Ahmed Bouajjani
    Michael Emmi
    International Journal on Software Tools for Technology Transfer, 2014, 16 : 127 - 146
  • [35] Towards visual development of message-passing programs
    Stankovic, N
    Zhang, K
    1997 IEEE SYMPOSIUM ON VISUAL LANGUAGES, PROCEEDINGS, 1997, : 144 - 151
  • [36] Reachability testing of asynchronous message-passing programs
    Tai, KC
    SECOND INTERNATIONAL WORKSHOP ON SOFTWARE ENGINEERING FOR PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1997, : 50 - 61
  • [37] Deadlock analysis of synchronous message-passing programs
    Zhou, J
    Tai, KC
    INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1999, : 62 - 69
  • [38] Automatic differentiation for message-passing parallel programs
    Hovland, P
    Bischof, C
    FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, : 98 - 104
  • [39] Distributed breakpoint detection in message-passing programs
    Drummond, LMD
    Barbosa, VC
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 39 (02) : 153 - 167
  • [40] Bounded Phase Analysis of Message-Passing Programs
    Bouajjani, Ahmed
    Emmi, Michael
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2012, 2012, 7214 : 451 - 465