{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:28Z","timestamp":1780994608162,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,11]],"date-time":"2016-09-11T00:00:00Z","timestamp":1473552000000},"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":[[2016,9,11]]},"DOI":"10.1145\/2967938.2967943","type":"proceedings-article","created":{"date-parts":[[2016,8,31]],"date-time":"2016-08-31T12:32:08Z","timestamp":1472646728000},"page":"247-259","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Sparso"],"prefix":"10.1145","author":[{"given":"Hongbo","family":"Rong","sequence":"first","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jongsoo","family":"Park","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingxiang","family":"Xiang","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Todd A.","family":"Anderson","sequence":"additional","affiliation":[{"name":"Intel Corporation, Hillsborough, OR, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikhail","family":"Smelyanskiy","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,9,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users' Guide","author":"Anderson E.","year":"1999","unstructured":"E. Anderson , Z. Bai , C. Bischof , S. Blackford , J. Demmel , J. Dongarra , J. Du Croz , A. Greenbaum , S. Hammarling , A. McKenney , and D. Sorensen . LAPACK Users' Guide . Society for Industrial and Applied Mathematics , Philadelphia, PA , third edition, 1999 . E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK Users' Guide. Society for Industrial and Applied Mathematics, Philadelphia, PA, third edition, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/266469.266486"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1155\/1999\/304639"},{"key":"e_1_3_2_1_4_1","volume-title":"Julia: A Fast Dynamic Language for Technical Computing. Computing Research Repository, abs\/1209.5145","author":"Bezanson J.","year":"2012","unstructured":"J. Bezanson , S. Karpinski , V. B. Shah , and A. Edelman . Julia: A Fast Dynamic Language for Technical Computing. Computing Research Repository, abs\/1209.5145 , 2012 . J. Bezanson, S. Karpinski, V. B. Shah, and A. Edelman. Julia: A Fast Dynamic Language for Technical Computing. Computing Research Repository, abs\/1209.5145, 2012."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8534-8_9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/297805.297827"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800195.805928"},{"key":"e_1_3_2_1_12_1","unstructured":"S. Dalton N. Bell L. Olson and M. Garland. Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations. http:\/\/cusplibrary.github.io 2014. Version 0.5.0.  S. Dalton N. Bell L. Olson and M. Garland. Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations. http:\/\/cusplibrary.github.io 2014. Version 0.5.0."},{"key":"e_1_3_2_1_13_1","series-title":"Fundamentals of Algorithms 2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"Davis T. A.","year":"2006","unstructured":"T. A. Davis . Direct Methods for Sparse Linear Systems ( Fundamentals of Algorithms 2 ) . Society for Industrial and Applied Mathematics , 2006 . T. A. Davis. Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2). Society for Industrial and Applied Mathematics, 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316693"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301670"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/355958.355963"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/567806.567810"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089018"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/365723.365732"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"e_1_3_2_1_26_1","first-page":"241","volume-title":"Parallel Computational Fluid Dynamics: towards Teraflops, Optimization, and Novel Formulations","author":"Gropp W. D.","year":"1999","unstructured":"W. D. Gropp , D. K. Kaushik , D. E. Keyes , and B. F. Smith . Towards Realistic Performance Bounds for Implicit CFD Codes . In Parallel Computational Fluid Dynamics: towards Teraflops, Optimization, and Novel Formulations , pages 241 -- 248 . Elsevier , 1999 . W. D. Gropp, D. K. Kaushik, D. E. Keyes, and B. F. Smith. Towards Realistic Performance Bounds for Implicit CFD Codes. In Parallel Computational Fluid Dynamics: towards Teraflops, Optimization, and Novel Formulations, pages 241--248. Elsevier, 1999."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(01)00115-5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089021"},{"key":"e_1_3_2_1_29_1","volume-title":"Math Kernel Library Inspector-executor Sparse BLAS Routines. https:\/\/software.intel.com\/sites\/default\/files\/managed\/0a\/81\/Documentation_inspector_executor_sparse_blas_mkl113b.pdf","year":"2015","unstructured":"Intel\u2122. Math Kernel Library Inspector-executor Sparse BLAS Routines. https:\/\/software.intel.com\/sites\/default\/files\/managed\/0a\/81\/Documentation_inspector_executor_sparse_blas_mkl113b.pdf , 2015 . Intel\u2122. Math Kernel Library Inspector-executor Sparse BLAS Routines. https:\/\/software.intel.com\/sites\/default\/files\/managed\/0a\/81\/Documentation_inspector_executor_sparse_blas_mkl113b.pdf, 2015."},{"key":"e_1_3_2_1_30_1","volume-title":"MKL PARDISO - Parallel Direct Sparse Solver Interface. https:\/\/software.intel.com\/en-us\/node\/470282","year":"2015","unstructured":"Intel\u211c. MKL PARDISO - Parallel Direct Sparse Solver Interface. https:\/\/software.intel.com\/en-us\/node\/470282 , 2015 . Intel\u211c. MKL PARDISO - Parallel Direct Sparse Solver Interface. https:\/\/software.intel.com\/en-us\/node\/470282, 2015."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/512927.512945"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/645781.666661"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089017"},{"key":"e_1_3_2_1_34_1","unstructured":"M. Lichman. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml 2013.  M. Lichman. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml 2013."},{"key":"e_1_3_2_1_35_1","volume-title":"On the Limited Memory BFGS Method for Large Scale Optimization. Mathematical Programming, 45(1)","author":"Liu D. C.","year":"1989","unstructured":"D. C. Liu and J. Nocedal . On the Limited Memory BFGS Method for Large Scale Optimization. Mathematical Programming, 45(1) , 1989 . D. C. Liu and J. Nocedal. On the Limited Memory BFGS Method for Large Scale Optimization. Mathematical Programming, 45(1), 1989."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6289128"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)83270-6"},{"key":"e_1_3_2_1_38_1","first-page":"19","volume-title":"IEEE Computer Society Technical Committee on Computer Architecture (TCCA) Newsletter","author":"McCalpin J. D.","year":"1995","unstructured":"J. D. McCalpin . Memory Bandwidth and Machine Balance in Current High Performance Computers . IEEE Computer Society Technical Committee on Computer Architecture (TCCA) Newsletter , pages 19 -- 25 , Dec. 1995 . J. D. McCalpin. Memory Bandwidth and Machine Balance in Current High Performance Computers. IEEE Computer Society Technical Committee on Computer Architecture (TCCA) Newsletter, pages 19--25, Dec. 1995."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/55364.55378"},{"key":"e_1_3_2_1_40_1","unstructured":"M. Naumov. Incomplete-LU and Cholesky Preconditioned Iterative Methods Using cuSPARSE and cuBLAS. https:\/\/developer.nvidia.com\/cusparse.  M. Naumov. Incomplete-LU and Cholesky Preconditioned Iterative Methods Using cuSPARSE and cuBLAS. https:\/\/developer.nvidia.com\/cusparse."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.66.155115"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0713023"},{"key":"e_1_3_2_1_43_1","unstructured":"J. Park. Sparse Matrix Preprocessing Library. https:\/\/github.com\/IntelLabs\/SpMP.  J. Park. Sparse Matrix Preprocessing Library. https:\/\/github.com\/IntelLabs\/SpMP."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07518-1_8"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.82"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20119-1_4"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/169627.169752"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/645676.663645"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00024-6"},{"key":"e_1_3_2_1_50_1","first-page":"693","volume-title":"Proceedings of Advances in Neural Information Processing Systems (NIPS)","author":"Recht B.","year":"2011","unstructured":"B. Recht , C. Re , S. Wright , and F. Niu . Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent . In Proceedings of Advances in Neural Information Processing Systems (NIPS) , pages 693 -- 701 . Curran Associates, Inc. , 2011 . B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent. In Proceedings of Advances in Neural Information Processing Systems (NIPS), pages 693--701. Curran Associates, Inc., 2011."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/050629938"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Method for Large Eigenvalue Problems","author":"Saad Y.","year":"2011","unstructured":"Y. Saad . Numerical Method for Large Eigenvalue Problems . Society for Industrial and Applied Mathematics , 2011 . Y. Saad. Numerical Method for Large Eigenvalue Problems. Society for Industrial and Applied Mathematics, 2011."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/14063.14074"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610518"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362652"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-37658-0_5","volume-title":"Proceedings of Languages and Compilers for Parallel Computing: 25th International Workshop, LCPC","author":"Strout M. M.","year":"2013","unstructured":"M. M. Strout , G. Georg , and C. Olschanowsky . Set and Relation Manipulation for the Sparse Polyhedral Framework . In Proceedings of Languages and Compilers for Parallel Computing: 25th International Workshop, LCPC , Tokyo, Japan , September 11--13, Revised Selected Papers, pages 61 -- 75 . Springer Berlin Heidelberg , 2013 . M. M. Strout, G. Georg, and C. Olschanowsky. Set and Relation Manipulation for the Sparse Polyhedral Framework. In Proceedings of Languages and Compilers for Parallel Computing: 25th International Workshop, LCPC, Tokyo, Japan, September 11--13, Revised Selected Papers, pages 61--75. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2738003"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/103135.103136"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"}],"event":{"name":"PACT '16: International Conference on Parallel Architectures and Compilation","location":"Haifa Israel","acronym":"PACT '16","sponsor":["IFIP WG 10.3 IFIP WG 10.3","IEEE TCCA IEEE Computer Society Technical Committee on Computer Architecture","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS TCPP IEEE Computer Society Technical Committee on Parallel Processing"]},"container-title":["Proceedings of the 2016 International Conference on Parallel Architectures and Compilation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2967938.2967943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2967938.2967943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:49:58Z","timestamp":1750218598000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2967938.2967943"}},"subtitle":["Context-driven Optimizations of Sparse Linear Algebra"],"short-title":[],"issued":{"date-parts":[[2016,9,11]]},"references-count":55,"alternative-id":["10.1145\/2967938.2967943","10.1145\/2967938"],"URL":"https:\/\/doi.org\/10.1145\/2967938.2967943","relation":{},"subject":[],"published":{"date-parts":[[2016,9,11]]},"assertion":[{"value":"2016-09-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}