Improving I/O Performance for Exascale Applications Through Online Data Layout Reorganization

被引:15
作者
Wan, Lipeng [1 ]
Huebl, Axel [2 ]
Gu, Junmin [2 ]
Poeschel, Franz [3 ]
Gainaru, Ana [1 ]
Wang, Ruonan [1 ]
Chen, Jieyang [1 ]
Liang, Xin [5 ]
Ganyushin, Dmitry [1 ]
Munson, Todd [4 ]
Foster, Ian [4 ]
Vay, Jean-Luc [2 ]
Podhorszki, Norbert [1 ]
Wu, Kesheng [2 ]
Klasky, Scott [1 ]
机构
[1] Oak Ridge Natl Lab, Comp Sci & Math Div, Oak Ridge, TN 37830 USA
[2] Lawrence Berkeley Natl Lab, Berkeley, CA 94720 USA
[3] Ctr Adv Syst Understanding CASUS, D-02826 Gorlitz, Germany
[4] Argonne Natl Lab, Lemont, IL 60439 USA
[5] Missouri Univ Sci & Technol, Rolla, MO 65409 USA
关键词
Layout; Arrays; Heuristic algorithms; Computational modeling; Performance evaluation; Optimization; Distributed databases; Parallel IO; data layout; IO performance; WarpX; data access optimization;
D O I
10.1109/TPDS.2021.3100784
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The applications being developed within the U.S. Exascale Computing Project (ECP) to run on imminent Exascale computers will generate scientific results with unprecedented fidelity and record turn-around time. Many of these codes are based on particle-mesh methods and use advanced algorithms, especially dynamic load-balancing and mesh-refinement, to achieve high performance on Exascale machines. Yet, as such algorithms improve parallel application efficiency, they raise new challenges for I/O logic due to their irregular and dynamic data distributions. Thus, while the enormous data rates of Exascale simulations already challenge existing file system write strategies, the need for efficient read and processing of generated data introduces additional constraints on the data layout strategies that can be used when writing data to secondary storage. We review these I/O challenges and introduce two online data layout reorganization approaches for achieving good tradeoffs between read and write performance. We demonstrate the benefits of using these two approaches for the ECP particle-in-cell simulation WarpX, which serves as a motif for a large class of important Exascale applications. We show that by understanding application I/O patterns and carefully designing data layouts we can increase read performance by more than 80 percent.
引用
收藏
页码:878 / 890
页数:13
相关论文
共 38 条
[1]  
Abbasi H, 2009, HPDC'09: 18TH ACM INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE DISTRIBUTED COMPUTING, P39
[2]  
[Anonymous], 2010, COMPUTER WEEKLY
[3]   AN ALGORITHM FOR POINT CLUSTERING AND GRID GENERATION [J].
BERGER, M ;
RIGOUTSOS, I .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (05) :1278-1286
[4]  
Byna S., 2017, P CUG
[5]  
Chen YJ, 2010, COMPREHENSIVE EVALUATION OF ECONOMY AND SOCIETY WITH STATISTICAL SCIENCE, P302, DOI 10.1109/CLUSTER.2010.35
[6]  
Foster I., IN PRESS
[7]  
Foster I, 2017, LECT NOTES COMPUT SC, V10417, P3, DOI [10.1007/978-3-319-64203-1_1, 10.1109/HiPC.2017.00042]
[8]   ADIOS 2: The Adaptable Input Output System. A framework for high-performance data management [J].
Godoy, William F. ;
Podhorszki, Norbert ;
Wang, Ruonan ;
Atkins, Chuck ;
Eisenhauer, Greg ;
Gu, Junmin ;
Davis, Philip ;
Choi, Jong ;
Germaschewski, Kai ;
Huck, Kevin ;
Huebl, Axel ;
Kim, Mark ;
Kress, James ;
Kurc, Tahsin ;
Liu, Qing ;
Logan, Jeremy ;
Mehta, Kshitij ;
Ostrouchov, George ;
Parashar, Manish ;
Poeschel, Franz ;
Pugmire, David ;
Suchyta, Eric ;
Takahashi, Keichi ;
Thompson, Nick ;
Tsutsumi, Seiji ;
Wan, Lipeng ;
Wolf, Matthew ;
Wu, Kesheng ;
Klasky, Scott .
SOFTWAREX, 2020, 12
[9]   Querying Large Scientific Data Sets with Adaptable IO System ADIOS [J].
Gu, Junmin ;
Klasky, Scott ;
Podhorszki, Norbert ;
Qiang, Ji ;
Wu, Kesheng .
SUPERCOMPUTING FRONTIERS, SCFA 2018, 2018, 10776 :51-69
[10]   Optimizing Parallel I/O Accesses through Pattern-Directed and Layout-Aware Replication [J].
He, Shuibing ;
Yin, Yanlong ;
Sun, Xian-He ;
Zhang, Xuechen ;
Li, Zongpeng .
IEEE TRANSACTIONS ON COMPUTERS, 2020, 69 (02) :212-225