{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:12Z","timestamp":1750220832392,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Shanghai Natural Science Foundation","award":["18ZR1403100"],"award-info":[{"award-number":["18ZR1403100"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400214","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"575-577","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Balanced Partitioning of Several Cache-Oblivious Algorithms"],"prefix":"10.1145","author":[{"given":"Yuan","family":"Tang","sequence":"first","affiliation":[{"name":"Fudan University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"IBM Journal of Research and Development","volume":"39","author":"Agarwal R. C.","year":"1995","unstructured":"R. C. Agarwal , S. M. Balle , F. G. Gustavson , M. Joshi , and P. Palkar . 1995. A three-dimensional approach to parallel matrix multiplication . IBM Journal of Research and Development , Vol. 39 ( Sep. 1995 ), 575--582. Issue 5. R. C. Agarwal, S. M. Balle, F. G. Gustavson, M. Joshi, and P. Palkar. 1995. A three-dimensional approach to parallel matrix multiplication. IBM Journal of Research and Development, Vol. 39 (Sep. 1995), 575--582. Issue 5."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312021"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312044"},{"key":"e_1_3_2_1_4_1","volume-title":"Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. CoRR","author":"Ballard Grey","year":"2012","unstructured":"Grey Ballard , James Demmel , Olga Holtz , Benjamin Lipshitz , and Oded Schwartz . 2012c. Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. CoRR , Vol. abs\/ 1202 .3177 ( 2012 ). Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, and Oded Schwartz. 2012c. Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds. CoRR, Vol. abs\/1202.3177 (2012)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_3_2_1_6_1","first-page":"6","article-title":"Graph Expansion and Communication Costs of Fast Matrix Multiplication","volume":"59","author":"Ballard Grey","year":"2013","unstructured":"Grey Ballard , James Demmel , Olga Holtz , and Oded Schwartz . 2013 . Graph Expansion and Communication Costs of Fast Matrix Multiplication . J. ACM , Vol. 59 , 6 (Jan. 2013). Grey Ballard, James Demmel, Olga Holtz, and Oded Schwartz. 2013. Graph Expansion and Communication Costs of Fast Matrix Multiplication. J. ACM, Vol. 59, 6 (Jan. 2013).","journal-title":"J. ACM"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2812804"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008","author":"Blelloch Guy E.","year":"2008","unstructured":"Guy E. Blelloch , Rezaul Alam Chowdhury , Phillip B. Gibbons , Vijaya Ramachandran , Shimin Chen , and Michael Kozuch . 2008 . Provably good multicore cache performance for divide-and-conquer algorithms . In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008 , San Francisco, California, USA, January 20--22 , 2008. 501--510. Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, and Michael Kozuch. 2008. Provably good multicore cache performance for divide-and-conquer algorithms. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20--22, 2008. 501--510."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989553"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810519"},{"volume-title":"Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 207--216","author":"Chowdhury R.","key":"e_1_3_2_1_13_1","unstructured":"R. Chowdhury and V. Ramachandran . 2008. Cache-efficient Dynamic Programming Algorithms for Multicores . In Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 207--216 . R. Chowdhury and V. Ramachandran. 2008. Cache-efficient Dynamic Programming Algorithms for Multicores. In Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 207--216."},{"key":"e_1_3_2_1_14_1","volume-title":"Cache-Oblivious Dynamic Programming. In In Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '06","author":"Chowdhury Rezaul Alam","year":"2006","unstructured":"Rezaul Alam Chowdhury and Vijaya Ramachandran . 2006 . Cache-Oblivious Dynamic Programming. In In Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '06 . 591--600. Rezaul Alam Chowdhury and Vijaya Ramachandran. 2006. Cache-Oblivious Dynamic Programming. In In Proc. of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '06. 591--600."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.04.008"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470354"},{"key":"e_1_3_2_1_17_1","volume-title":"Efficient Resource Oblivious Algorithms for Multicores. CoRR","author":"Cole Richard","year":"2011","unstructured":"Richard Cole and Vijaya Ramachandran . 2011. Efficient Resource Oblivious Algorithms for Multicores. CoRR , Vol. abs\/ 1103 .4071 ( 2011 ). Richard Cole and Vijaya Ramachandran. 2011. Efficient Resource Oblivious Algorithms for Multicores. CoRR, Vol. abs\/1103.4071 (2011)."},{"key":"e_1_3_2_1_18_1","volume-title":"Efficient Resource Oblivious Algorithms for Multicores with False Sharing. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012","author":"Cole Richard","year":"2012","unstructured":"Richard Cole and Vijaya Ramachandran . 2012 . Efficient Resource Oblivious Algorithms for Multicores with False Sharing. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012 , Shanghai, China, May 21--25 , 2012. 201--214. Richard Cole and Vijaya Ramachandran. 2012. Efficient Resource Oblivious Algorithms for Multicores with False Sharing. In 26th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2012, Shanghai, China, May 21--25, 2012. 201--214."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3040221"},{"volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","key":"e_1_3_2_1_20_1","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms third ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms third ed.). The MIT Press."},{"key":"e_1_3_2_1_21_1","volume-title":"Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In 27th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2013","author":"Demmel James","year":"2013","unstructured":"James Demmel , David Eliahu , Armando Fox , Shoaib Kamil , Benjamin Lipshitz , Oded Schwartz , and Omer Spillinger . 2013 . Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In 27th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2013 , Cambridge, MA, USA, May 20--24 , 2013. 261--272. James Demmel, David Eliahu, Armando Fox, Shoaib Kamil, Benjamin Lipshitz, Oded Schwartz, and Omer Spillinger. 2013. Communication-Optimal Parallel Recursive Rectangular Matrix Multiplication. In 27th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2013, Cambridge, MA, USA, May 20--24, 2013. 261--272."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9098-2"},{"key":"e_1_3_2_1_24_1","unstructured":"Charles E. Leiserson. [n. d.]. Performance Engineering of Software Systems .  Charles E. Leiserson. [n. d.]. Performance Engineering of Software Systems ."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.33"},{"key":"e_1_3_2_1_26_1","volume-title":"24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12","author":"Shun Julian","year":"2012","unstructured":"Julian Shun , Guy E. Blelloch , Jeremy T. Fineman , Phillip B. Gibbons , Aapo Kyrola , Harsha Vardhan Simhadri , and Kanat Tangwongsan . 2012 . The problem based benchmark suite . In 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12 , Pittsburgh, PA, USA, June 25--27 , 2012. 68--70. Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, and Kanat Tangwongsan. 2012. The problem based benchmark suite. In 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25--27, 2012. 68--70."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033408.2033420"}],"event":{"name":"SPAA '20: 32nd 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":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:34Z","timestamp":1750202014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":25,"alternative-id":["10.1145\/3350755.3400214","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400214","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}