Performance of message-passing systems using a zero-copy communication protocol

被引:1
|
作者
Melas, P [1 ]
Zaluska, EJ [1 ]
机构
[1] Univ Southampton, Southampton SO9 5NH, Hants, England
来源
1998 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PROCEEDINGS | 1998年
关键词
D O I
10.1109/PACT.1998.727260
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Despite technological advantages in microprocessors and network technology over the last few years, commercially-available networks of workstations (NOWs) contain inherent communication bottlenecks Traditional layered network protocols will inevitably fail to achieve high throughput if they access data several times. As a result, applications an NOWs often fail to observe the performance speed-up that might be expected. Network protocols which avoid routing through the kernel can remove this limit an communication performance and support very high transmission speeds, turning NOWs into an attractive alternative to Massively-Parallel Processors. This paper investigates the improvements in performance of an entire NOW system that are possible by changing communication protocols. A commodity workstation cluster with a zero-copy communication protocol (Basic Interface Parallelism) is examined and compared with both conventional protocol implementations and parallel systems in order to understand and assess the improvements in performance achieved.
引用
收藏
页码:264 / 271
页数:8
相关论文
共 50 条
  • [31] Fault-Tolerant Communication over Micronmesh NOC with Micron Message-Passing Protocol
    Kariniemi, Heikki
    Nurmi, Jari
    2009 INTERNATIONAL SYMPOSIUM ON SYSTEM-ON-CHIP PROCEEDINGS, 2009, : 5 - 12
  • [32] THE PERFORMANCE OF MESSAGE-PASSING USING RESTRICTED VIRTUAL MEMORY REMAPPING
    TZOU, SY
    ANDERSON, DP
    SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (03): : 251 - 267
  • [33] High Performance Message-Passing InfiniBand Communication Device for Java']Java HPC
    Khan, Omar
    Jameel, Mohsan
    Shafi, Aamir
    2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, 2014, 29 : 1468 - 1479
  • [34] Performance modeling for SPMD message-passing programs
    Brehm, J
    Worley, PH
    Madhukar, M
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1998, 10 (05): : 333 - 357
  • [35] Snap-Stabilization in Message-Passing Systems
    Delaet, Sylvie
    Devismes, Stephane
    Nesterenko, Mikhail
    Tixeuil, Sebastien
    PODC'08: PROCEEDINGS OF THE 27TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2008, : 443 - 443
  • [36] Optimizing communication for array operations on message-passing multicomputers
    Eberhart, A
    Li, JK
    SECOND INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN '96), PROCEEDINGS, 1996, : 242 - 248
  • [37] Hiding communication latency in reconfigurable message-passing environments
    Afsahi, A
    Dimopoulos, NJ
    IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 55 - 60
  • [38] Communication Complexity Lower Bounds in Distributed Message-Passing
    Oshman, Rotem
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2014, 2014, 8576 : 14 - 17
  • [39] 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
  • [40] Unifying stabilization and termination in message-passing systems
    Arora, A
    Nesterenko, M
    21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2001, : 99 - 106