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 条
  • [41] Snap-stabilization in message-passing systems
    Delaet, Sylvie
    Devismes, Stephane
    Nesterenko, Mikhail
    Tixeuil, Sebastien
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2010, 70 (12) : 1220 - 1230
  • [42] Efficient message-passing within SMP systems
    Chen, XH
    Turner, D
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 2003, 2840 : 286 - 293
  • [43] Propositional dynamic logic for message-passing systems
    Bollig, Benedikt
    Kuske, Dietrich
    Meinecke, Ingmar
    FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 303 - +
  • [44] IMPLEMENTATION OF PRODUCTION SYSTEMS ON MESSAGE-PASSING COMPUTERS
    ACHARYA, A
    TAMBE, M
    GUPTA, A
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1992, 3 (04) : 477 - 487
  • [45] Snap-Stabilization in Message-Passing Systems
    Delaet, Sylvie
    Devismes, Stephane
    Nesterenko, Mikhail
    Tixeuil, Sebastien
    DISTRIBUTED COMPUTING AND NETWORKING, 2009, 5408 : 281 - +
  • [46] Unifying stabilization and termination in message-passing systems
    Anish Arora
    Mikhail Nesterenko
    Distributed Computing, 2005, 17 : 279 - 290
  • [47] Proof systems for message-passing process algebras
    School of Cognitive and Computing, Sciences, University of Sussex, Brighton, United Kingdom
    Formal Aspects Comput, 4 (379-407):
  • [48] EverParse: Verified Secure Zero-Copy Parsers for Authenticated Message Formats
    Ramananandro, Tahina
    Delignat-Lavaud, Antoine
    Fournet, Cedric
    Swamy, Nikhil
    Chajed, Tej
    Kobeissi, Nadim
    Protzenko, Jonathan
    PROCEEDINGS OF THE 28TH USENIX SECURITY SYMPOSIUM, 2019, : 1465 - 1482
  • [49] LoGPX: A New Communication Model for Message-Passing Programs
    Lin, Yufei
    Tang, Yuhua
    Guo, Xiaowei
    Xu, Xinhai
    PROCEEDINGS OF THE 2011 INTERNATIONAL SYMPOSIUM ON PERFORMANCE EVALUATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, 2011, : 213 - 219
  • [50] An efficient universal construction for message-passing systems
    Dutta, P
    Frolund, S
    Guerraoui, R
    Pochon, B
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2002, 2508 : 133 - 147