{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T04:09:58Z","timestamp":1751083798356,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031232190"},{"type":"electronic","value":"9783031232206"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-23220-6_2","type":"book-chapter","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T07:03:51Z","timestamp":1672729431000},"page":"20-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lightweight Array Contraction by\u00a0Trace-Based Polyhedral Analysis"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Thievenaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiji","family":"Kimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Alias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"issue":"7","key":"2_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/1273444.1254778","volume":"42","author":"C Alias","year":"2007","unstructured":"Alias, C., Baray, F., Darte, A.: Bee+ Cl@ k: an implementation of lattice-based array contraction in the source-to-source translator rose. ACM SIGPLAN Notices 42(7), 73\u201382 (2007)","journal-title":"ACM SIGPLAN Notices"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-24644-2_14","volume-title":"Languages and Compilers for Parallel Computing","author":"C Bastoul","year":"2004","unstructured":"Bastoul, C., Cohen, A., Girbal, S., Sharma, S., Temam, O.: Putting polyhedral loop transformations to work. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol. 2958, pp. 209\u2013225. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24644-2_14"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2845078","volume":"38","author":"SG Bhaskaracharya","year":"2016","unstructured":"Bhaskaracharya, S.G., Bondhugula, U., Cohen, A.: Automatic storage optimization for arrays. ACM Trans. Program. Lang. Syst. (TOPLAS) 38(3), 1\u201323 (2016)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bhaskaracharya, S.G., Bondhugula, U., Cohen, A.: SMO: an integrated approach to intra-array and inter-array storage optimization. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 526\u2013538 (2016)","DOI":"10.1145\/2837614.2837636"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer. In: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 101\u2013113 (2008)","DOI":"10.1145\/1375581.1375595"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Clauss, P., Fern\u00e1ndez, F.J., Garbervetsky, D., Verdoolaege, S.: Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Trans. Very Large Scale Integr. VLSI Syst. 17(8), 983\u2013996 (2009)","DOI":"10.1109\/TVLSI.2008.2002049"},{"issue":"10","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1109\/TC.2005.167","volume":"54","author":"A Darte","year":"2005","unstructured":"Darte, A., Schreiber, R., Villard, G.: Lattice-based memory allocation. IEEE Trans. Comput. 54(10), 1242\u20131257 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR8","unstructured":"Feautrier, P., Lengauer, C.: Polyhedron model. In: Encyclopedia of Parallel Computing, vol. 1, pp. 1581\u20131592 (2011)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Ketterlin, A., Clauss, P.: Prediction and trace compression of data access addresses through nested loop recognition. In: Proceedings of the 6th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 94\u2013103 (2008)","DOI":"10.1145\/1356058.1356071"},{"issue":"3\u20134","key":"2_CR10","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0167-8191(98)00029-5","volume":"24","author":"V Lefebvre","year":"1998","unstructured":"Lefebvre, V., Feautrier, P.: Automatic storage management for parallel programs. Parallel Comput. 24(3\u20134), 649\u2013671 (1998)","journal-title":"Parallel Comput."},{"issue":"5","key":"2_CR11","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1145\/365151.365152","volume":"22","author":"F Quiller\u00e9","year":"2000","unstructured":"Quiller\u00e9, F., Rajopadhye, S.: Optimizing memory usage in the polyhedral model. ACM Trans. Program. Lang. Syst. (TOPLAS) 22(5), 773\u2013815 (2000)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, G., Andi\u00f3n, J.M., Kandemir, M.T., Touri\u00f1o, J.: Trace-based affine reconstruction of codes. In: Proceedings of the 2016 International Symposium on Code Generation and Optimization, pp. 139\u2013149 (2016)","DOI":"10.1145\/2854038.2854056"},{"issue":"5","key":"2_CR13","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1007\/s10766-018-0597-3","volume":"47","author":"A Simb\u00fcrger","year":"2018","unstructured":"Simb\u00fcrger, A., Apel, S., Gr\u00f6\u00dflinger, A., Lengauer, C.: PolyJIT: polyhedral optimization just in time. Int. J. Parallel Program. 47(5), 874\u2013906 (2018). https:\/\/doi.org\/10.1007\/s10766-018-0597-3","journal-title":"Int. J. Parallel Program."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing. ISC High Performance 2022 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23220-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T13:09:06Z","timestamp":1683551346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23220-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031232190","9783031232206"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23220-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"18","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":"34% - 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":"4","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops a 27 papers have been accepted for publication out of a total of 43 submissions.","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)"}}]}}