{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:05Z","timestamp":1755880805315,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2004850"],"award-info":[{"award-number":["2004850"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659986","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"183-193","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Tightening I\/O Lower Bounds through the Hourglass Dependency Pattern"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2475-3309","authenticated-orcid":false,"given":"Lionel","family":"Eyraud-Dubois","sequence":"first","affiliation":[{"name":"Inria, Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, Talence, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0326-1807","authenticated-orcid":false,"given":"Guillaume","family":"Iooss","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7803-1822","authenticated-orcid":false,"given":"Julien","family":"Langou","sequence":"additional","affiliation":[{"name":"University of Colorado Denver & Centre Inria de Lyon, Denver, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6589-9956","authenticated-orcid":false,"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395121"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538587"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3181776"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Michael Christ James Demmel Nicholas Knight Thomas Scanlon and Katherine Yelick. 2013. Communication Lower Bounds and Optimal Algorithms for Programs that Reference Arrays -- Part 1. arxiv: 1308.0068v1 [math.CA]","DOI":"10.21236\/ADA584726"},{"key":"e_1_3_2_1_7_1","unstructured":"James Demmel Laura Grigori Mark Hoemmen and Julien Langou. 2008. Communication-optimal Parallel and Sequential QR and LU Factorizations. Technical Report UCB\/EECS-2008--89. Electrical Engineering and Computer Sciences University of California at Berkeley."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677010"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612694"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Lionel Eyraud-Dubois Guillaume Iooss Julien Langou and Fabrice Rastello. 2024. Tightening I\/O Lower Bounds through the Hourglass Dependency Pattern (Full version). https:\/\/inria.hal.science\/hal-04555744.","DOI":"10.1145\/3626183.3659986"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73588"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_1_16_1","unstructured":"Reference LAPACK. 1992. https:\/\/github.com\/Reference-LAPACK\/lapack."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454103"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385989"},{"key":"e_1_3_2_1_19_1","unstructured":"Louis-No\u00ebl Pouchet and Tomofumi Yuki. 2016. PolyBench\/C: The polyhedral benchmark suite version 4.2. http:\/\/polybench.sf.net."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--22685--4_12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.12.005"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755594"},{"key":"e_1_3_2_1_23_1","volume-title":"van de Geijn","author":"Smith Tyler Michael","year":"2019","unstructured":"Tyler Michael Smith, Bradley Lowery, Julien Langou, and Robert A. van de Geijn. 2019. A Tight I\/O Lower Bound for Matrix Multiplication. arxiv: 1702.02017 [cs.CC]"},{"key":"e_1_3_2_1_24_1","first-page":"299","article-title":"ISL","volume":"2010","author":"Verdoolaege Sven","year":"2010","unstructured":"Sven Verdoolaege. 2010. ISL: An Integer Set Library for the Polyhedral Model. In Mathematical Software--ICMS 2010. 299--302.","journal-title":"An Integer Set Library for the Polyhedral Model. In Mathematical Software--ICMS"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006--1231-0"}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659986","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659986","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:19Z","timestamp":1755879799000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659986"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":25,"alternative-id":["10.1145\/3626183.3659986","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659986","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}