{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T07:17:05Z","timestamp":1775978225198,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319201184","type":"print"},{"value":"9783319201191","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20119-1_4","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T06:36:48Z","timestamp":1434695808000},"page":"48-57","source":"Crossref","is-referenced-by-count":40,"title":["Parallel Efficient Sparse Matrix-Matrix Multiplication on Multicore Platforms"],"prefix":"10.1007","author":[{"given":"Md. Mostofa Ali","family":"Patwary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadathur Rajagopalan","family":"Satish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narayanan","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satya Gautam","family":"Vadlamudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dipankar","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey G.","family":"Pudov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim O.","family":"Pirogov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradeep","family":"Dubey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"4_CR1","unstructured":"Combinatorial Blas v 1.3. http:\/\/gauss.cs.ucsb.edu\/~aydin\/CombBLAS\/html\/"},{"key":"4_CR2","unstructured":"Thread affinity interface. https:\/\/software.intel.com\/en-us\/node\/522691"},{"key":"4_CR3","unstructured":"Intel math kernel library (2015). https:\/\/software.intel.com\/en-us\/intel-mkl"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"C123","DOI":"10.1137\/110838844","volume":"34","author":"N Bell","year":"2012","unstructured":"Bell, N., Dalton, S., Olson, L.N.: Exposing fine-grained parallelism in algebraic multigrid methods. SIAM J. Sci. Comput. 34(4), C123\u2013C152 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Buluc, A., Gilbert, J.: On the representation and multiplication of hypersparse matrices. In: Proceedings of IPDPS, pp. 1\u201311, April 2008","DOI":"10.1109\/IPDPS.2008.4536313"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments. CoRR abs\/1109.3739 (2011)","DOI":"10.1137\/1.9780898719918.ch14"},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.1137\/08071990X","volume":"39","author":"TM Chan","year":"2010","unstructured":"Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. SIAM J. Comput. 39(5), 2075\u20132089 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR8","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/0613024","volume":"13","author":"J Gilbert","year":"1992","unstructured":"Gilbert, J., Moler, C., Schreiber, R.: Sparse matrices in matlab: design and implementation. SIAM J. Matrix Anal. Appl. 13(1), 333\u2013356 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-75755-9_32","volume-title":"Applied Parallel Computing","author":"JR Gilbert","year":"2007","unstructured":"Gilbert, J.R., Reinhardt, S., Shah, V.B.: High-performance graph algorithms from parallel sparse matrices. In: K\u00e5gstr\u00f6m, B., Elmroth, E., Dongarra, J., Wa\u015bniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 260\u2013269. Springer, Heidelberg (2007)"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/355791.355796","volume":"4","author":"FG Gustavson","year":"1978","unstructured":"Gustavson, F.G.: Two fast algorithms for sparse matrices: multiplication and permuted transposition. ACM Trans. Math. Softw. 4(3), 250\u2013269 (1978)","journal-title":"ACM Trans. Math. Softw."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Sharir, M., Verbin, E.: Colored intersection searching via sparse rectangular matrix multiplication. In: Symposium on Computational Geometry, pp. 52\u201360. ACM (2006)","DOI":"10.1145\/1137856.1137866"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Liu, W., Vinter, B.: An efficient GPU general sparse matrix-matrix multiplication for irregular data. In: Proceedings of IPDPS, pp. 370\u2013381. IEEE (2014)","DOI":"10.1109\/IPDPS.2014.47"},{"key":"4_CR14","unstructured":"Murphy, R.C., Wheeler, K.B., Barrett, B.W., Ang, J.A.: Introducing the graph 500. Cray User\u2019s Group (2010)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Siegel, J., et al.: Efficient sparse matrix-matrix multiplication on heterogeneous high performance systems. In: IEEE Cluster Computing, pp. 1\u20138 (2010)","DOI":"10.1109\/CLUSTERWKSP.2010.5613109"},{"key":"4_CR16","unstructured":"Sulatycke, P., Ghose, K.: Caching-efficient multithreaded fast multiplication of sparse matrices. In: Proceedings of IPPS\/SPDP 1998, pp. 117\u2013123, March 1998"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Vassilevska, V., Williams, R., Yuster, R.: Finding heaviest h-subgraphs in real weighted graphs, with applications. CoRR abs\/cs\/0609009 (2006)","DOI":"10.1007\/11786986_24"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Graf, T., Sumbul, H., Pileggi, L., Franchetti, F.: Accelerating sparse matrix-matrix multiplication with 3D-stacked logic-in-memory hardware. In: IEEE HPEC, pp. 1\u20136 (2013)","DOI":"10.1109\/HPEC.2013.6670336"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20119-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T02:46:19Z","timestamp":1652496379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20119-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319201184","9783319201191"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20119-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}