{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T04:22:21Z","timestamp":1783138941630,"version":"3.54.6"},"reference-count":45,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p>Reverse Time Migration (RTM) is a state-of-the-art algorithm used in seismic depth imaging in complex geological environments for the oil and gas exploration industry. It calculates high-resolution images by solving the three-dimensional acoustic wave equation using seismic datasets recorded at various receiver locations. Reverse Time Migration\u2019s computational phases are predominantly composed of stencil computational kernels for the finite-difference time-domain scheme, applying the absorbing boundary conditions, and I\/O operations needed for the imaging condition. In this paper, we integrate the asynchronous Multicore Wavefront Diamond (MWD) tiling approach into the full RTM workflow. Multicore Wavefront Diamond permits to further increase data reuse by leveraging spatial with Temporal Blocking (TB) during the stencil computations. This integration engenders new challenges with a snowball effect on the legacy synchronous RTM workflow as it requires rethinking of how the absorbing boundary conditions, the I\/O operations, and the imaging condition operate. These disruptive changes are necessary to maintain the performance superiority of asynchronous stencil execution throughout the time integration, while ensuring the quality of the subsurface image does not deteriorate. We assess the overall performance of the new MWD-based RTM and compare against traditional Spatial Blocking (SB)-based RTM on various shared-memory systems using the SEG Salt3D model. The MWD-based RTM achieves up to 70% performance speedup compared to SB-based RTM. To our knowledge, this paper highlights for the first time the applicability of asynchronous executions with temporal blocking throughout the whole RTM. This may eventually create new research opportunities in improving hydrocarbon extraction for the petroleum industry.<\/jats:p>","DOI":"10.1177\/10943420221128529","type":"journal-article","created":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T07:54:05Z","timestamp":1664783645000},"page":"132-150","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Exploiting temporal data reuse and asynchrony in the reverse time migration"],"prefix":"10.1177","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8485-1520","authenticated-orcid":false,"given":"Long","family":"Qu","sequence":"first","affiliation":[{"name":"Extreme Computing Research Center, King Abdullah University of Science and Technology, Jeddah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rached","family":"Abdelkhalak","sequence":"additional","affiliation":[{"name":"NVIDIA, Jeddah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6897-1095","authenticated-orcid":false,"given":"Hatem","family":"Ltaief","sequence":"additional","affiliation":[{"name":"Extreme Computing Research Center, King Abdullah University of Science and Technology, Jeddah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Issam","family":"Said","sequence":"additional","affiliation":[{"name":"NVIDIA, Jeddah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Keyes","sequence":"additional","affiliation":[{"name":"Extreme Computing Research Center, King Abdullah University of Science and Technology, Jeddah, Saudi Arabia"},{"name":"Applied Mathematics and Computational Science, King Abdullah University of Science and Technology, Jeddah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"bibr1-10943420221128529","doi-asserted-by":"publisher","DOI":"10.2118\/194722-MS"},{"key":"bibr2-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1177\/1094342020923027"},{"key":"bibr3-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57675-2_17"},{"key":"bibr4-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.9"},{"key":"bibr5-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.107"},{"key":"bibr6-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/1.1441434"},{"key":"bibr7-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0001-4"},{"key":"bibr8-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375595"},{"key":"bibr9-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.70"},{"key":"bibr10-10943420221128529","volume-title":"Auto-tuning Stencil Codes for Cache-Based Multicore Platforms","author":"Datta K","year":"2009"},{"key":"bibr11-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1137\/070693199"},{"key":"bibr12-10943420221128529","doi-asserted-by":"publisher","DOI":"10.3997\/2214-4609.201702324"},{"key":"bibr13-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/segam2014-0176.1"},{"key":"bibr14-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/1.1440591"},{"key":"bibr15-10943420221128529","doi-asserted-by":"crossref","unstructured":"Frigo M, Strumpen V, Supercomputing Confon (2005) Cache oblivious stencil computations 19th Int. NY, USA: ACM, pp. 361\u2013366.","DOI":"10.1145\/1088149.1088197"},{"key":"bibr16-10943420221128529","volume-title":"GIRIH stencil optimization framework","author":"Girih","year":"2015"},{"key":"bibr17-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544160"},{"key":"bibr18-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626414410023"},{"key":"bibr19-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2467268"},{"key":"bibr20-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304619"},{"key":"bibr21-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/1.3627855"},{"key":"bibr22-10943420221128529","doi-asserted-by":"publisher","DOI":"10.5194\/gmd-12-1165-2019"},{"key":"bibr23-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/3374916"},{"issue":"31","key":"bibr24-10943420221128529","first-page":"1232","volume":"4","author":"Malas T","year":"2017","journal-title":"ACM Trans. Parallel Comput"},{"key":"bibr25-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1137\/140991133"},{"key":"bibr26-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2478.1983.tb01060.x"},{"key":"bibr27-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.2"},{"key":"bibr28-10943420221128529","volume-title":"Diamond Tiling: A Tiling Framework for Time-Iterated Scientific Applications","author":"Orozco D","year":"2009"},{"key":"bibr29-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19595-2_6"},{"key":"bibr30-10943420221128529","first-page":"367","volume":"53","author":"Rumley S","year":"2017","journal-title":"Parallel Computing"},{"key":"bibr31-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/1.1440828"},{"key":"bibr32-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/eScience.2011.62"},{"key":"bibr33-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2011.47"},{"key":"bibr34-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989508"},{"key":"bibr35-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1088\/1742-2132\/5\/2\/007"},{"key":"bibr36-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2017.02.022"},{"key":"bibr37-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2703149"},{"key":"bibr38-10943420221128529","first-page":"579","volume":"1","author":"Wellein G","year":"2009","journal-title":"33rd Annual IEEE Int. Computer Software and Applications Conference"},{"key":"bibr39-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/1.1893867"},{"key":"bibr40-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.845979"},{"key":"bibr41-10943420221128529","first-page":"3","volume-title":"Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques","author":"Wonnacott DG","year":"2013"},{"key":"bibr42-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126920"},{"key":"bibr43-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1109\/P3HPC.2018.00009"},{"key":"bibr44-10943420221128529","volume-title":"Tiling Optimizations for Stencil Computations","author":"Zhou X","year":"2013"},{"key":"bibr45-10943420221128529","doi-asserted-by":"publisher","DOI":"10.1190\/1.1444416"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420221128529","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420221128529","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420221128529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:17:24Z","timestamp":1777450644000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420221128529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,3]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1177\/10943420221128529"],"URL":"https:\/\/doi.org\/10.1177\/10943420221128529","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,3]]}}}