{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:53:08Z","timestamp":1785041588632,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989531","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"257-258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Grey","family":"Ballard","sequence":"first","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Gearhart","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"G. Ballard J. Demmel and A. Gearhart. Communication bounds for heterogeneous architectures. Technical report UC Berkeley EECS-2011-13 Feb. 2011.  G. Ballard J. Demmel and A. Gearhart. Communication bounds for heterogeneous architectures. Technical report UC Berkeley EECS-2011-13 Feb. 2011."},{"key":"e_1_3_2_1_2_1","unstructured":"G. Ballard J. Demmel O. Holtz and O. Schwartz. Minimizing communication in linear algebra. Technical report UC Berkeley EECS-2011-15 Feb. 2011.  G. Ballard J. Demmel O. Holtz and O. Schwartz. Minimizing communication in linear algebra. Technical report UC Berkeley EECS-2011-15 Feb. 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645606.661333"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"D.\n       \n      Wise\n    .\n      \n  \n   \n  Ahnentafel indexing into Morton-ordered arrays or matrix locality for free. In A. Bode T. Ludwig W. Karl and R. Wism\u00fcller editors Euro-Par 2000 Parallel Processing volume \n  1900\n   of \n  Lecture Notes in Computer Science pages \n  774\n  --\n  783\n  . \n  Springer Berlin \/ Heidelberg 2000\n  .   D. Wise. Ahnentafel indexing into Morton-ordered arrays or matrix locality for free. In A. Bode T. Ludwig W. Karl and R. Wism\u00fcller editors Euro-Par 2000 Parallel Processing volume 1900 of Lecture Notes in Computer Science pages 774--783. Springer Berlin \/ Heidelberg 2000.","DOI":"10.1007\/3-540-44520-X_108"}],"event":{"name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"San Jose California USA","acronym":"SPAA '11","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"]},"container-title":["Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989531","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989531"}},"subtitle":["communication bounds for heterogeneous architectures"],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":6,"alternative-id":["10.1145\/1989493.1989531","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989531","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}