Memory-Access Optimization of Parallel Molecular Dynamics Simulation via Dynamic Data Reordering

被引:0
|
作者
Kunaseth, Manaschai [1 ]
Nomura, Ken-ichi [1 ]
Dursun, Hikmet [1 ]
Kalia, Rajiv K. [1 ]
Nakano, Aiichiro [1 ]
Vashishta, Priya [1 ]
机构
[1] Univ So Calif, Los Angeles, CA 90089 USA
来源
基金
美国国家科学基金会;
关键词
Data reordering; memory-access optimization; data fragmentation; performance degradation; molecular dynamics;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Dynamic irregular applications such as molecular dynamics (MD) simulation often suffer considerable performance deterioration during execution. To address this problem, an optimal data-reordering schedule has been developed for runtime memory-access optimization of MD simulations on parallel computers. Analysis of the memory-access penalty during MD simulations shows that the performance improvement from computation and data reordering degrades gradually as data translation lookaside buffer misses increase. We have also found correlations between the performance degradation with physical properties such as the simulated temperature, as well as with computational parameters such as the spatial-decomposition granularity. Based on a performance model and pre-profiling of data fragmentation behaviors, we have developed an optimal runtime data-reordering schedule, thereby archiving speedup of 1.35, 1.36 and 1.28, respectively, for MD simulations of silica at temperatures 300 K, 3,000 K and 6,000 K.
引用
收藏
页码:781 / 792
页数:12
相关论文
共 50 条
  • [1] Predicting memory-access cost based on data-access patterns
    Byna, S
    Sun, XH
    Gropp, W
    Thakur, R
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, 2004, : 327 - 336
  • [2] Integration of code scheduling, memory allocation, and array binding for memory-access optimization
    Kim, Taewhan
    Kim, Jungeun
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2007, 26 (01) : 142 - 151
  • [3] Multibank Memory Optimization for Parallel Data Access in Multiple Data Arrays
    Yin, Shouyi
    Xie, Zhicong
    Meng, Chenyue
    Liu, Leibo
    Wei, Shaojun
    [J]. 2016 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2016,
  • [4] Simulee: Detecting CUDA Synchronization Bugs via Memory-Access Modeling
    Wu, Mingyuan
    Ouyang, Yicheng
    Zhou, Husheng
    Zhang, Lingming
    Liu, Cong
    Zhang, Yuqun
    [J]. 2020 ACM/IEEE 42ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE 2020), 2020, : 937 - 948
  • [5] Toddler: Detecting Performance Problems via Similar Memory-Access Patterns
    Nistor, Adrian
    Song, Linhai
    Marinov, Darko
    Lu, Shan
    [J]. PROCEEDINGS OF THE 35TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE 2013), 2013, : 562 - 571
  • [6] Efficient Memory Partitioning for Parallel Data Access via Data Reuse
    Su, Jincheng
    Yang, Fan
    Zeng, Xuan
    Zhou, Dian
    [J]. PROCEEDINGS OF THE 2016 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE GATE ARRAYS (FPGA'16), 2016, : 138 - 147
  • [7] Memory Access Optimization of Molecular Dynamics Simulation Software Crystal-MD on Sunway TaihuLight
    Li, Jianjiang
    Lin, Jie
    Du, Panpan
    Zhang, Kai
    Wu, Jie
    [J]. TSINGHUA SCIENCE AND TECHNOLOGY, 2021, 26 (03) : 296 - 308
  • [8] Efficient Memory Partitioning for Parallel Data Access in FPGA via Data Reuse
    Su, Jincheng
    Yang, Fan
    Zeng, Xuan
    Zhou, Dian
    Chen, Jie
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2017, 36 (10) : 1674 - 1687
  • [9] Memory-Access Optimization for Acceleration and Power Saving of FPGA-Based Image Processing
    Shimohane, Shungo
    Inoue, Toshiyuki
    Tsuchiya, Akira
    Kishine, Keiji
    [J]. 2022 19TH INTERNATIONAL SOC DESIGN CONFERENCE (ISOCC), 2022, : 338 - 339
  • [10] Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages
    Karrenberg, Ralf
    Kosta, Marek
    Sturm, Thomas
    [J]. FRONTIERS OF COMBINING SYSTEMS (FROCOS 2013), 2013, 8152 : 56 - 70