{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,16]],"date-time":"2025-11-16T06:25:28Z","timestamp":1763274328939,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Agence Nationale de la Recherche, France","award":["ANR-19-CE46-0009"],"award-info":[{"award-number":["ANR-19-CE46-0009"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538587","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"423-433","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["I\/O-Optimal Algorithms for Symmetric Linear Algebra Kernels"],"prefix":"10.1145","author":[{"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[{"name":"Inria Centre at the University of Bordeaux, Bordeaux, France"}]},{"given":"Lionel","family":"Eyraud-Dubois","sequence":"additional","affiliation":[{"name":"Inria Centre at the University of Bordeaux, Bordeaux, France"}]},{"given":"Julien","family":"Langou","sequence":"additional","affiliation":[{"name":"University of Colorado Denver, Denver, CO, USA"}]},{"given":"Mathieu","family":"V\u00e9rit\u00e9","sequence":"additional","affiliation":[{"name":"Inria Centre at the University of Bordeaux, Bordeaux, France"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492914000038"},{"key":"e_1_3_2_1_2_1","volume-title":"Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs\/0902.2537","author":"Ballard Grey","year":"2009","unstructured":"Grey Ballard , James Demmel , Olga Holtz , and Oded Schwartz . 2009. Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs\/0902.2537 ( 2009 ). Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz. 2009. Communication-optimal Parallel and Sequential Cholesky Decomposition. CoRR abs\/0902.2537 (2009)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/090760969"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/06067256X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"L Susan Blackford Jaeyoung Choi Andy Cleary Eduardo D'Azevedo James Demmel Inderjit Dhillon Jack Dongarra Sven Hammarling Greg Henry Antoine Petitet etal 1997. ScaLAPACK users' guide. SIAM.  L Susan Blackford Jaeyoung Choi Andy Cleary Eduardo D'Azevedo James Demmel Inderjit Dhillon Jack Dongarra Sven Hammarling Greg Henry Antoine Petitet et al. 1997. ScaLAPACK users' guide. SIAM.","DOI":"10.1137\/1.9780898719642"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/057"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2388996.2389132"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"volume-title":"Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing","author":"Jia-Wei Hong","key":"e_1_3_2_1_10_1","unstructured":"Hong Jia-Wei and H. T. Kung . 1981. I\/O Complexity: The Red-blue Pebble Game . In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing ( Milwaukee, Wisconsin, USA) (STOC '81). ACM, New York, NY, USA, 326--333. https:\/\/doi.org\/10.1145\/800076.802486 10.1145\/800076.802486 Hong Jia-Wei and H. T. Kung. 1981. I\/O Complexity: The Red-blue Pebble Game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing (Milwaukee, Wisconsin, USA) (STOC '81). ACM, New York, NY, USA, 326--333. https:\/\/doi.org\/10.1145\/800076.802486"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476167"},{"key":"e_1_3_2_1_12_1","volume-title":"Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests. In In Proceedings of the 2000 ACM International Conference on Supercomputing. 141--152","author":"Nikolay Nawaaz Ahmed","year":"2000","unstructured":"Nawaaz Ahmed Nikolay , Nikolay Mateev , and Keshav Pingali . 2000 . Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests. In In Proceedings of the 2000 ACM International Conference on Supercomputing. 141--152 . Nawaaz Ahmed Nikolay, Nikolay Mateev, and Keshav Pingali. 2000. Synthesizing Transformations for Locality Enhancement of Imperfectly-nested Loop Nests. In In Proceedings of the 2000 ACM International Conference on Supercomputing. 141--152."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385989"},{"key":"e_1_3_2_1_15_1","article-title":"Trade- Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations","volume":"3","author":"Solomonik Edgar","year":"2017","unstructured":"Edgar Solomonik , Erin Carson , Nicholas Knight , and James Demmel . 2017 . Trade- Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations . ACM Trans. Parallel Comput. 3 , 1, Article 3 (jan 2017), 47 pages. https:\/\/doi.org\/10.1145\/2897188 10.1145\/2897188 Edgar Solomonik, Erin Carson, Nicholas Knight, and James Demmel. 2017. Trade- Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations. ACM Trans. Parallel Comput. 3, 1, Article 3 (jan 2017), 47 pages. https:\/\/doi.org\/10.1145\/2897188","journal-title":"ACM Trans. Parallel Comput."},{"key":"#cr-split#-e_1_3_2_1_16_1.1","doi-asserted-by":"crossref","unstructured":"Edgar Solomonik and James Demmel. 2011. Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. 90--109. https: \/\/doi.org\/10.1007\/978--3--642--23397--5_10 10.1007\/978--3--642--23397--5_10","DOI":"10.1007\/978-3-642-23397-5_10"},{"key":"#cr-split#-e_1_3_2_1_16_1.2","doi-asserted-by":"crossref","unstructured":"Edgar Solomonik and James Demmel. 2011. Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. 90--109. https: \/\/doi.org\/10.1007\/978--3--642--23397--5_10","DOI":"10.1007\/978-3-642-23397-5_10"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"}],"event":{"name":"SPAA '22: 34th 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":"Philadelphia PA USA","acronym":"SPAA '22"},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538587","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":18,"alternative-id":["10.1145\/3490148.3538587","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538587","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}