Performance and Scalability Analysis for Parallel Reservoir Simulations on Three Supercomputer Architectures

被引:2
|
作者
Liu, Hui [1 ]
Zhang, Peng [2 ]
Wang, Kun [1 ]
Yang, Bo [1 ]
Chen, Zhangxin [1 ]
机构
[1] Univ Calgary, Dept Chem & Petr Engn, Calgary, AB, Canada
[2] SUNY Stony Brook, Coll Engn & Appl Sci, Stony Brook, NY USA
关键词
Parallel reservoir simulation; black oil model; performance evaluation; parallel computing; LINPACK;
D O I
10.1145/2949550.2949577
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this work, we tested the performance and scalability on three supercomputers of different architectures including SDSC's Comet, SciNet's GPC and IBM's Blue Gene/Q systems, through benchmarking parallel reservoir simulations. The Comet and GPC systems adopt a fat-tree network and they are connected with InfiniBand interconnects technology. The Blue Gene/Q uses a 5-dimensional toroidal network and it is connected with custom interconnects. In terms of supercomputer architectures, these systems represent two main interconnect families: fat-tree and torus. To demonstrate the application scalability for supercomputers with today's diversified architectures, we benchmark a parallel black oil simulator that is extensively used in the petroleum industry. Our implementation for this simulator is coded in C and MPI, and it offers grids, data, linear solvers, preconditioners, distributed matrices and vectors and modeling modules. Load balancing is based on the Hilbert space-filling curve (HSFC) method. Krylov subspace and AMG solvers are implemented, including restarted GMRES, BiCGSTAB, and AMG solvers from Hypre. The results show that the Comet is the fastest supercomputer among tested systems and the Blue Gene/Q has the best parallel efficiency. The scalability analysis helps to identify the performance barriers for different supercomputer architectures. The study of testing the application performance serves to provide the insights for carrying out parallel reservoir simulations on large-scale computers of different architectures.
引用
收藏
页数:8
相关论文
共 50 条
  • [41] Scalability matters: High performance architectures for computational chemistry.
    Landman, J
    Zirl, D
    Gomperts, R
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2001, 221 : U409 - U409
  • [42] DESIGN AND PERFORMANCE ANALYSIS OF HARDWARE SUPPORT FOR PARALLEL SIMULATIONS
    REYNOLDS, PF
    PANCERELLA, CM
    SRINIVASAN, S
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1993, 18 (04) : 435 - 453
  • [43] Industrial flow simulations using different parallel architectures
    Vos, JB
    Haberhauer, S
    Ytterstrom, A
    PARALLEL COMPUTATIONAL FLUID DYNAMICS: RECENT DEVELOPMENTS AND ADVANCES USING PARALLEL COMPUTERS, 1998, : 513 - 520
  • [44] Fast parallel particle simulations on distributed memory architectures
    Hipp, M
    Kunze, S
    Ritt, M
    Rosenstiel, W
    Ruder, H
    HIGH PERFORMANCE COMPUTING IN SCIENCE AND ENGINEERING 01, 2002, : 485 - 499
  • [45] Parallel simulations of seismic wave propagation on NUMA architectures
    Dupros, Fabrice
    Pousa Ribeiro, Christiane
    Carissimi, Alexandre
    Mehaut, Jean-Francois
    PARALLEL COMPUTING: FROM MULTICORES AND GPU'S TO PETASCALE, 2010, 19 : 67 - 74
  • [46] The effects of parallel processing architectures on discrete event simulations
    Cave, W
    Slatt, E
    Wassmer, RE
    Enabling Technologies for Simulation Science IX, 2005, 5805 : 337 - 348
  • [47] HIGH CHIP DENSITY BOOSTS PERFORMANCE OF INTERACTIVE PARALLEL SUPERCOMPUTER
    BOND, J
    COMPUTER DESIGN, 1989, 28 (17): : 48 - &
  • [48] Performance variability of highly parallel architectures
    Kramer, WTC
    Ryan, C
    COMPUTATIONAL SCIENCE - ICCS 2003, PT III, PROCEEDINGS, 2003, 2659 : 560 - 569
  • [49] Scalability of the parallel CFD simulations of flow past a fluttering airfoil in OpenFOAM
    Sidlof, Petr
    Ridky, Vaclav
    EFM14 - EXPERIMENTAL FLUID MECHANICS 2014, 2015, 92
  • [50] Comparing the optimal performance of parallel architectures
    Klonowska, K
    Lundberg, L
    Lennerstad, H
    Broberg, M
    COMPUTER JOURNAL, 2004, 47 (05): : 527 - 544