{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T21:39:30Z","timestamp":1775338770461,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030293994","type":"print"},{"value":"9783030294007","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_7","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"87-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Combining Checkpointing and Data Compression to Accelerate Adjoint-Based Optimization Problems"],"prefix":"10.1007","author":[{"given":"Navjot","family":"Kukreja","sequence":"first","affiliation":[]},{"given":"Jan","family":"H\u00fcckelheim","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Louboutin","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Hovland","sequence":"additional","affiliation":[]},{"given":"Gerard","family":"Gorman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"7_CR1","unstructured":"https:\/\/computation.llnl.gov\/projects\/floating-point-compression\/zfp-and-derivatives"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MCSE.2010.51","volume":"12","author":"F Alted","year":"2010","unstructured":"Alted, F.: Why modern cpus are starving and what can be done about it. Comput. Sci. Eng. 12(2), 68 (2010)","journal-title":"Comput. Sci. Eng."},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1190\/1.1437283","volume":"15","author":"F Aminzadeh","year":"1996","unstructured":"Aminzadeh, F., Burkhard, N., Long, J., Kunz, T., Duclos, P.: Three dimensional SEG\/EAGE models\u2013an update. Lead. Edge 15(2), 131\u2013134 (1996)","journal-title":"Lead. Edge"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"C232","DOI":"10.1137\/15M1019222","volume":"38","author":"G Aupy","year":"2016","unstructured":"Aupy, G., Herrmann, J., Hovland, P., Robert, Y.: Optimal multistage algorithm for adjoint computation. SIAM J. Sci. Comput. 38(3), C232\u2013C255 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR5","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust region method for nonconvex optimization. arXiv preprint arXiv:1609.07428 (2016)"},{"issue":"6","key":"7_CR6","doi-asserted-by":"publisher","first-page":"R385","DOI":"10.1190\/geo2015-0653.1","volume":"81","author":"C Boehm","year":"2016","unstructured":"Boehm, C., Hanzich, M., de la Puente, J., Fichtner, A.: Wavefield compression for adjoint methods in full-waveform inversion. Geophysics 81(6), R385\u2013R397 (2016)","journal-title":"Geophysics"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cma.2014.12.001","volume":"288","author":"EC Cyr","year":"2015","unstructured":"Cyr, E.C., Shadid, J., Wildey, T.: Towards efficient backward-in-time adjoint computations using data compression techniques. Comput. Methods Appl. Mech. Eng. 288, 24\u201344 (2015)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"7_CR8","unstructured":"Dalmau, F.R., Hanzich, M., de la Puente, J., Guti\u00e9rrez, N.: Lossy data compression with DCT transforms. In: EAGE Workshop on High Performance Computing for Upstream (2014)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/MCSE.2018.042781325","volume":"20","author":"D Datta","year":"2018","unstructured":"Datta, D., Appelhans, D., Evangelinos, C., Jordan, K.: An asynchronous two-level checkpointing method to solve adjoint problems on hierarchical memory spaces. Comput. Sci. Eng. 20(4), 39\u201355 (2018)","journal-title":"Comput. Sci. Eng."},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TPDS.2018.2859932","volume":"30","author":"S Di","year":"2018","unstructured":"Di, S., Tao, D., Liang, X., Cappello, F.: Efficient lossy compression for scientific data based on pointwise relative error bound. IEEE Trans. Parallel Distrib. Syst. 30(2), 331\u2013345 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/347837.347846","volume":"26","author":"A Griewank","year":"2000","unstructured":"Griewank, A., Walther, A.: Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Trans. Math. Softw. (TOMS) 26(1), 19\u201345 (2000)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"7_CR12","unstructured":"Kukreja, N., H\u00fcckelheim, J., Lange, M., Louboutin, M., Walther, A., Funke, S.W., Gorman, G.: High-level python abstractions for optimal checkpointing in inversion problems. arXiv preprint arXiv:1802.02474 (2018)"},{"issue":"5","key":"7_CR13","doi-asserted-by":"publisher","first-page":"S192","DOI":"10.1137\/130918629","volume":"36","author":"T van Leeuwen","year":"2014","unstructured":"van Leeuwen, T., Herrmann, F.J.: 3d frequency-domain seismic inversion with controlled sloppiness. SIAM J. Sci. Comput. 36(5), S192\u2013S217 (2014)","journal-title":"SIAM J. Sci. Comput."},{"issue":"12","key":"7_CR14","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TVCG.2014.2346458","volume":"20","author":"P Lindstrom","year":"2014","unstructured":"Lindstrom, P.: Fixed-rate compressed floating-point arrays. IEEE Trans. Visual Comput. Graphics 20(12), 2674\u20132683 (2014)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Louboutin, M., Lange, M., Luporini, F., Kukreja, N., Witte, P.A., Herrmann, F.J., Velesko, P., Gorman, G.J.: Devito: an embedded domain-specific language for finite differences and geophysical exploration. CoRR abs\/1808.01995, August 2018. https:\/\/arxiv.org\/abs\/1808.01995","DOI":"10.5194\/gmd-2018-189"},{"key":"7_CR16","unstructured":"Marin, O., Schanen, M., Fischer, P.: Large-scale lossy data compression based on an a priori error estimator in a spectral element code. Technical report, ANL\/MCS-P6024-0616 (2016)"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"O\u2019Neil, M.A., Burtscher, M.: Floating-point data compression at 75 gb\/s on a GPU. In: Proceedings of the Fourth Workshop on General Purpose Processing on Graphics Processing Units. ACM (2011). https:\/\/doi.org\/10.1145\/1964179.1964189","DOI":"10.1145\/1964179.1964189"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1365-246X.2006.02978.x","volume":"167","author":"RE Plessix","year":"2006","unstructured":"Plessix, R.E.: A review of the adjoint-state method for computing the gradient of a functional with geophysical applications. Geophys. J. Int. 167(2), 495\u2013503 (2006)","journal-title":"Geophys. J. Int."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1946","DOI":"10.1137\/080718036","volume":"31","author":"P Stumm","year":"2009","unstructured":"Stumm, P., Walther, A.: Multistage approaches for optimal offline checkpointing. SIAM J. Sci. Comput. 31(3), 1946\u20131967 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"7_CR20","doi-asserted-by":"publisher","first-page":"SM213","DOI":"10.1190\/1.2742686","volume":"72","author":"WW Symes","year":"2007","unstructured":"Symes, W.W.: Reverse time migration with optimal checkpointing. Geophysics 72(5), SM213\u2013SM221 (2007)","journal-title":"Geophysics"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Tao, D., Di, S., Liang, X., Chen, Z., Cappello, F.: Optimizing lossy compression rate-distortion from automatic online selection between sz and zfp. arXiv preprint arXiv:1806.08901 (2018)","DOI":"10.1109\/TPDS.2019.2894404"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:02:51Z","timestamp":1691884971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}