{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:16:39Z","timestamp":1784182599227,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T00:00:00Z","timestamp":1194652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006132","name":"Office of Science","doi-asserted-by":"publisher","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100006132","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,11,10]]},"DOI":"10.1145\/1362622.1362674","type":"proceedings-article","created":{"date-parts":[[2008,4,22]],"date-time":"2008-04-22T19:41:13Z","timestamp":1208893273000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":312,"title":["Optimization of sparse matrix-vector multiplication on emerging multicore platforms"],"prefix":"10.1145","author":[{"given":"Samuel","family":"Williams","sequence":"first","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA and University of California at Berkeley, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leonid","family":"Oliker","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Vuduc","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Shalf","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katherine","family":"Yelick","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA and University of California at Berkeley, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,11,10]]},"reference":[{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/266469.266486"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/40.782564"},{"key":"e_1_3_2_1_6_1","first-page":"308","volume-title":"Proceedings of the International Conference on Parallel Computing (ParCo)","author":"Geus R.","year":"1999","unstructured":"R. Geus and S. R\u00f6llin . Towards a fast parallel sparse matrix-vector multiplication. In E. H. D'Hollander, J. R. Joubert, F. J. Peters, and H. Sips, editors , Proceedings of the International Conference on Parallel Computing (ParCo) , pages 308 -- 315 . Imperial College Press , 1999 . R. Geus and S. R\u00f6llin. Towards a fast parallel sparse matrix-vector multiplication. In E. H. D'Hollander, J. R. Joubert, F. J. Peters, and H. Sips, editors, Proceedings of the International Conference on Parallel Computing (ParCo), pages 308--315. Imperial College Press, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1128022.1128023"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2006.41"},{"key":"e_1_3_2_1_9_1","volume-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy J. L.","year":"2006","unstructured":"J. L. Hennessy and D. A. Patterson . Computer Architecture: A Quantitative Approach ; fourth edition. Morgan Kaufmann , San Francisco , 2006 . J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach; fourth edition. Morgan Kaufmann, San Francisco, 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342004041296"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018425.1020284"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. LACSI Symposium","author":"Mellor-Crummey J.","year":"2002","unstructured":"J. Mellor-Crummey and J. Garvin . Optimizing sparse matrix vector multiply using unroll-and-jam . In Proc. LACSI Symposium , Santa Fe, NM, USA , October 2002 . J. Mellor-Crummey and J. Garvin. Optimizing sparse matrix vector multiply using unroll-and-jam. In Proc. LACSI Symposium, Santa Fe, NM, USA, October 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-007-0038-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/331532.331562"},{"key":"e_1_3_2_1_15_1","first-page":"183","volume-title":"Graph Theory and Computing","author":"Rose D. J.","year":"1973","unstructured":"D. J. Rose . A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations . Graph Theory and Computing , pages 183 -- 217 , 1973 . D. J. Rose. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. Graph Theory and Computing, pages 183--217, 1973."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/147877.148091"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.416.0711"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502409019"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the ICCS Workshop on Parallel Linear Algebra","volume":"2003","author":"Vuduc R.","unstructured":"R. Vuduc , A. Gyulassy , J. W. Demmel , and K. A. Yelick . Memory hierarchy optimizations and bounds for sparse ATAx . In Proceedings of the ICCS Workshop on Parallel Linear Algebra , volume LNCS, Melbourne, Australia, June 2003 . Springer. R. Vuduc, A. Gyulassy, J. W. Demmel, and K. A. Yelick. Memory hierarchy optimizations and bounds for sparse ATAx. In Proceedings of the ICCS Workshop on Parallel Linear Algebra, volume LNCS, Melbourne, Australia, June 2003. Springer."},{"key":"e_1_3_2_1_22_1","volume-title":"ICS 2002: Workshop on Performance Optimization via High-Level Languages and Libraries","author":"Vuduc R.","year":"2002","unstructured":"R. Vuduc , S. Kamil , J. Hsu , R. Nishtala , J. W. Demmel , and K. A. Yelick . Automatic performance tuning and analysis of sparse triangular solve . In ICS 2002: Workshop on Performance Optimization via High-Level Languages and Libraries , New York, USA , June 2002 . R. Vuduc, S. Kamil, J. Hsu, R. Nishtala, J. W. Demmel, and K. A. Yelick. Automatic performance tuning and analysis of sparse triangular solve. In ICS 2002: Workshop on Performance Optimization via High-Level Languages and Libraries, New York, USA, June 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183444"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. Midwest Instruction and Computing Symposium, Mt","author":"Willenbring J. W.","year":"2006","unstructured":"J. W. Willenbring , A. A. Anda , and M. Heroux . Improving sparse matrix-vector product kernel performance and availabillity . In Proc. Midwest Instruction and Computing Symposium, Mt . Pleasant, IA , 2006 . J. W. Willenbring, A. A. Anda, and M. Heroux. Improving sparse matrix-vector product kernel performance and availabillity. In Proc. Midwest Instruction and Computing Symposium, Mt. Pleasant, IA, 2006."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1017\/s10766-007-0034-5"}],"event":{"name":"SC '07: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Reno Nevada","acronym":"SC '07","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 2007 ACM\/IEEE conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1362622.1362674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1362622.1362674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:13:48Z","timestamp":1750259628000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1362622.1362674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,10]]},"references-count":21,"alternative-id":["10.1145\/1362622.1362674","10.1145\/1362622"],"URL":"https:\/\/doi.org\/10.1145\/1362622.1362674","relation":{},"subject":[],"published":{"date-parts":[[2007,11,10]]},"assertion":[{"value":"2007-11-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}