A lightweight, high performance communication protocol for grid computing

被引:1
|
作者
Dickens, Phillip M. [1 ]
机构
[1] Univ Maine, Dept Comp Sci, Orono, ME 04469 USA
基金
美国国家科学基金会;
关键词
Grid computing; High-performance communication protocols; High-performance networking; Bayesian analysis; Classification mechanisms; WIRELESS NETWORKS; CONGESTION; COMPLEXITY; LOSSES;
D O I
10.1007/s10586-009-0107-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes a lightweight, high-performance communication protocol for the high-bandwidth, high-delay networks typical of computational Grids. One unique feature of this protocol is that it incorporates an extremely accurate classification mechanism that is efficient enough to diagnose the cause of data loss in real time, providing to the controller the opportunity to respond to different causes of data loss in different ways. The simplest adaptive response, and the one discussed in this paper, is to trigger aggressive congestion control measures only when the data loss is diagnosed as network related. However, even this very simple adaptation can have a tremendous impact on performance in a Grid setting where the resources allocated to a long-running, data-intensive application can fluctuate significantly during the course of its execution. In fact, we provide results showing that the utilization of the information provided by the classifier increased performance by over two orders of magnitude depending on the dominant cause of data loss. In this paper, we discuss the Bayesian statistical framework upon which the classifier is based and the classification metrics that make this approach highly successful. We discuss the integration of the classifier into the congestion control structures of an existing high-performance communication protocol, and provide empirical results showing that it correctly diagnosed the cause of data loss in over 98% of the experimental trials.
引用
收藏
页码:47 / 66
页数:20
相关论文
共 50 条
  • [1] A lightweight, high performance communication protocol for grid computing
    Phillip M. Dickens
    Cluster Computing, 2010, 13 : 47 - 66
  • [2] FOBS: A lightweight communication protocol for grid computing
    Dickens, PM
    EURO-PAR 2003 PARALLEL PROCESSING, PROCEEDINGS, 2003, 2790 : 938 - 946
  • [3] A high performance configurable transport protocol for grid computing
    Wu, RX
    Chien, AA
    Hiltunen, MA
    Schlichting, RD
    Sen, S
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID, VOLS 1 AND 2, 2005, : 1117 - 1125
  • [4] Analysis of a lightweight Transport Protocol for high-performance computing
    Dantas, MAR
    Lima, MVGR
    Rodrigues, MRA
    HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, 2002, 657 : 291 - 299
  • [5] A Lightweight Authentication and Communication Protocol in Vehicular Cloud Computing
    Vasudev, Harsha
    Das, Debasis
    33RD INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2019), 2019, : 72 - 77
  • [6] Grid architecture for High Performance Computing
    Derbal, Youcef
    2007 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, 2007, : 514 - 517
  • [7] Performance Evaluation of Data Transfer Protocol GridFTP for Grid Computing
    Ohsaki, Hiroyuki
    Imase, Makoto
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 16, 2006, 16 : 297 - 302
  • [8] A communication framework for high performance computing
    Kandasamy, N
    Ammar, RA
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 10TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 1997, : 489 - 495
  • [9] A Lightweight VMM on Many Core for High Performance Computing
    Dai, Yuehua
    Qi, Yong
    Ren, Jianbao
    Shi, Yi
    Wang, Xiaoguang
    Yu, Xuan
    ACM SIGPLAN NOTICES, 2013, 48 (07) : 110 - 119
  • [10] Lightweight Provenance Service for High-Performance Computing
    Dai, Dong
    Chen, Yong
    Carns, Philip
    Jenkins, John
    Ross, Robert
    2017 26TH INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT), 2017, : 117 - 129