Optimizing Forward Computation in Adjoint Method via Multi-level Blocking

T. Ikeda, S. Ito, H. Nagao, T. Katagiri, Toru Nagai, M. Ogino
{"title":"Optimizing Forward Computation in Adjoint Method via Multi-level Blocking","authors":"T. Ikeda, S. Ito, H. Nagao, T. Katagiri, Toru Nagai, M. Ogino","doi":"10.1145/3149457.3149458","DOIUrl":null,"url":null,"abstract":"Data assimilation (DA) is a computational technique that integrates large-scale numerical simulations with observed data, and the adjoint method is classified as a non-sequential DA technique. The target model for the simulations in this paper is the phase-field model, which is often used to simulate the temporal evolution of the internal structures of materials. Since the phase-field method computes a continuous field, a naïve implementation of the adjoint method requires an enormous amount of computation time. One reason for the increase in computation time is that the amount of data required for simulations is much larger than the cache capacity of computers. To reduce memory access and achieve better performance, it is necessary to use computational blocking, which involves reusing data within the cache as much as possible. In this paper, we propose multi-level blocking to optimize forward computation in the adjoint method. The proposed multi-level blocking consists of spatial blocking, temporal blocking, and the blocking of multiple forward computations in the adjoint method. We investigated the effectiveness of the proposed multi-level blocking on the Fujitsu PRIMEHPC FX100 supercomputer. By applying spatial and temporal blocking, we attained a speed-up of 1.89 x in execution time without blocking and that of 1.48 x as the upper limit by applying blocking to multiple forward computations (MFB). We also attained a speed-up of 1.13 by applying multi-level blocking to execution time without blocking.","PeriodicalId":314778,"journal":{"name":"Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","volume":"9 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3149457.3149458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data assimilation (DA) is a computational technique that integrates large-scale numerical simulations with observed data, and the adjoint method is classified as a non-sequential DA technique. The target model for the simulations in this paper is the phase-field model, which is often used to simulate the temporal evolution of the internal structures of materials. Since the phase-field method computes a continuous field, a naïve implementation of the adjoint method requires an enormous amount of computation time. One reason for the increase in computation time is that the amount of data required for simulations is much larger than the cache capacity of computers. To reduce memory access and achieve better performance, it is necessary to use computational blocking, which involves reusing data within the cache as much as possible. In this paper, we propose multi-level blocking to optimize forward computation in the adjoint method. The proposed multi-level blocking consists of spatial blocking, temporal blocking, and the blocking of multiple forward computations in the adjoint method. We investigated the effectiveness of the proposed multi-level blocking on the Fujitsu PRIMEHPC FX100 supercomputer. By applying spatial and temporal blocking, we attained a speed-up of 1.89 x in execution time without blocking and that of 1.48 x as the upper limit by applying blocking to multiple forward computations (MFB). We also attained a speed-up of 1.13 by applying multi-level blocking to execution time without blocking.
基于多级块的伴随法正演优化
数据同化(Data assimilation, DA)是一种将大规模数值模拟与观测数据相结合的计算技术,伴随方法属于非顺序数据同化技术。本文模拟的目标模型是相场模型,该模型常用于模拟材料内部结构的时间演化。由于相场法计算的是连续场,因此伴随法的naïve实现需要大量的计算时间。计算时间增加的一个原因是模拟所需的数据量远远大于计算机的缓存容量。为了减少内存访问并获得更好的性能,有必要使用计算阻塞,这涉及尽可能多地重用缓存中的数据。在本文中,我们提出了多级阻塞来优化伴随方法中的正演计算。本文提出的多级阻塞包括空间阻塞、时间阻塞和伴随方法中多次正演计算的阻塞。我们在Fujitsu PRIMEHPC FX100超级计算机上研究了所提出的多级阻塞的有效性。通过应用空间和时间阻塞,我们在没有阻塞的情况下获得了1.89倍的执行时间加速,而在多次前向计算(MFB)中应用阻塞时获得了1.48倍的速度提升上限。通过对执行时间应用多级阻塞而不阻塞,我们还获得了1.13的速度提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信