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 条
  • [41] Orthogonal processor groups for message-passing programs
    Rauber, T
    Reilein, R
    Rünger, G
    HIGH-PERFORMANCE COMPUTING AND NETWORKING, 2001, 2110 : 363 - 372
  • [42] Easy-Par: A hybrid environment based on message-passing and distributed shared memory
    Dantas, MAR
    Melo, ACMA
    HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, 2000, 541 : 403 - 411
  • [43] Programming shared memory multiprocessors with deterministic message-passing concurrency: Compiling SHIM to Pthreads
    Edwards, Stephen A.
    Vasudevan, Nalini
    Tardieu, Olivier
    2008 DESIGN, AUTOMATION AND TEST IN EUROPE, VOLS 1-3, 2008, : 1302 - +
  • [44] A GLOBAL-MEMORY MESSAGE-PASSING MULTIPROCESSOR
    JOHNSON, EE
    MICROPROCESSORS AND MICROSYSTEMS, 1991, 15 (08) : 403 - 410
  • [45] Comparative evaluation of parallel genetic algorithms on message passing and software shared-memory clusters
    Tiamkaew, E
    Louis, SJ
    Kongmunvattana, A
    PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 2002, : 443 - 448
  • [46] Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems
    Imbs, Damien
    Rajsbaum, Sergio
    Raynal, Michel
    Stainer, Julien
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2016, 93-94 : 1 - 9
  • [47] Restructuring and extensible simulator for shared memory and message passing parallel programs
    Ramesh, T.
    Sudhakar, Chaprarn
    2006 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATIONS, VOLS 1 AND 2, 2007, : 1 - 6
  • [48] SHARING MEMORY ROBUSTLY IN MESSAGE-PASSING SYSTEMS
    ATTIYA, H
    BARNOY, A
    DOLEV, D
    JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 1995, 42 (01): : 124 - 142
  • [49] Sharing memory robustly in message-passing systems
    Attiya, Hagit, 1600, ACM, New York (42):
  • [50] Static single assignment form for message-passing programs
    Chakrabarti, DR
    Banerjee, P
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2001, 29 (02) : 139 - 184