Exploring the relationship between parallel application run-time variability and network performance in clusters

被引:0
|
作者
Evans, JJ [1 ]
Hood, CS [1 ]
Gropp, WD [1 ]
机构
[1] Purdue Univ, Dept Elect & Comp Engn Technol, W Lafayette, IN 47907 USA
关键词
cluster; Mryinet; application run-time sensitivity; network performance;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Highly variable parallel application execution time is a persistent issue in cluster computing environments, and can be particularly acute in systems composed of Networks of Workstations (NOWs). We are looking at this issue in terms of consistency. In particular we are focusing on network performance. Before we can use techniques from fault management to attain consistency, this paper presents our preliminary analysis of run-time variability from logs and experiments, exposing important issues related to systemic inconsistency in NOW clusters. The characterization of application sensitivity can be used to set network performance goals, thereby defining operational requirements. Network performance depends on the virtual topology imposed by the scheduler's allocation of nodes and the communication patterns of the set of running applications. Therefore it is important to look at both the network and the cluster's centralized node mapper (scheduler) as critical subsystems.
引用
收藏
页码:538 / 547
页数:10
相关论文
共 50 条
  • [31] Modelling parallel overhead from simple run-time records
    Hoefinger, Siegfried
    Haunschmid, Ernst
    [J]. JOURNAL OF SUPERCOMPUTING, 2017, 73 (10): : 4390 - 4406
  • [32] Efficient compiler and run-time support for parallel irregular reductions
    Han, H
    Tseng, CW
    [J]. PARALLEL COMPUTING, 2000, 26 (13-14) : 1861 - 1887
  • [33] Modelling parallel overhead from simple run-time records
    Siegfried Höfinger
    Ernst Haunschmid
    [J]. The Journal of Supercomputing, 2017, 73 : 4390 - 4406
  • [34] Run-time selection of block size in pipelined parallel programs
    Lowenthal, DK
    James, M
    [J]. IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 82 - 87
  • [35] A parallel configuration model for reducing the run-time reconfiguration overhead
    Qu, Yang
    Soininen, Juha-Pekka
    Nurmi, Jari
    [J]. 2006 DESIGN AUTOMATION AND TEST IN EUROPE, VOLS 1-3, PROCEEDINGS, 2006, : 963 - +
  • [36] Run-time library for parallel I/O for irregular applications
    No, J
    Choudhary, A
    [J]. PARALLEL COMPUTING: FUNDAMENTALS, APPLICATIONS AND NEW DIRECTIONS, 1998, 12 : 437 - 440
  • [37] Efficient run-time scheduling for parallelizing partially parallel loops
    Huang, TC
    Hsu, PH
    Sheng, TN
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1998, 14 (01) : 255 - 264
  • [38] A universal infrastructure for the run-time monitoring of parallel and distributed applications
    Wismüller, R
    Trinitis, J
    Ludwig, T
    [J]. EURO-PAR '98 PARALLEL PROCESSING, 1998, 1470 : 173 - 180
  • [39] Message passing on InfiniBand RDMA for parallel run-time supports
    Secco, Alessandro
    Uddin, Irfan
    Pezzi, Guilherme Peretti
    Torquati, Massimo
    [J]. 2014 22ND EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2014), 2014, : 130 - 137
  • [40] Run-time loop restructuring for on-chip parallel processor
    Tamatsukuri, J
    Matsumoto, T
    Hiraki, K
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 1489 - 1496