{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:59:47Z","timestamp":1755838787517,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T00:00:00Z","timestamp":1551916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key R&D Program of China","award":["2018YFB0203800"],"award-info":[{"award-number":["2018YFB0203800"]}]},{"DOI":"10.13039\/501100010225","name":"National Outstanding Youth Foundation of China","doi-asserted-by":"publisher","award":["61625202"],"award-info":[{"award-number":["61625202"]}],"id":[{"id":"10.13039\/501100010225","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010896","name":"International Cooperation and Exchange Programme","doi-asserted-by":"publisher","award":["61661146006","61860206011"],"award-info":[{"award-number":["61661146006","61860206011"]}],"id":[{"id":"10.13039\/501100010896","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010905","name":"Major Research Plan","doi-asserted-by":"publisher","award":["61572175"],"award-info":[{"award-number":["61572175"]}],"id":[{"id":"10.13039\/501100010905","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61806077"],"award-info":[{"award-number":["61806077"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010083","name":"Hunan Provincial Innovation Foundation for Postgraduate","doi-asserted-by":"crossref","award":["CX2018B230"],"award-info":[{"award-number":["CX2018B230"]}],"id":[{"id":"10.13039\/501100010083","id-type":"DOI","asserted-by":"crossref"}]},{"name":"International Postdoctoral Exchange Fellowship Program of China Postdoctoral","award":["OCPC2017032"],"award-info":[{"award-number":["OCPC2017032"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00521-019-04121-z","type":"journal-article","created":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T11:42:30Z","timestamp":1551958950000},"page":"5571-5582","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimizing partitioned CSR-based SpGEMM on the Sunway TaihuLight"],"prefix":"10.1007","volume":"32","author":[{"given":"Yuedan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5008-4829","authenticated-orcid":false,"given":"Guoqing","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wangdong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,7]]},"reference":[{"issue":"5","key":"4121_CR1","doi-asserted-by":"publisher","first-page":"C568","DOI":"10.1137\/13092589X","volume":"36","author":"K Akbudak","year":"2014","unstructured":"Akbudak K, Aykanat C (2014) Simultaneous input and output matrix partitioning for outer-product-parallel sparse matrix\u2013matrix multiplication. SIAM J. Sci. Comput. 36(5):C568\u2013C590","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"4121_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3155292","volume":"4","author":"K Akbudak","year":"2018","unstructured":"Akbudak K, Selvitopi RO, Aykanat C (2018) Partitioning models for scaling parallel sparse matrix\u2013matrix multiplication. TOPC 4(3):13:1\u201313:34","journal-title":"TOPC"},{"key":"4121_CR3","doi-asserted-by":"crossref","unstructured":"Ballard G, Druinsky A, Knight N, Schwartz O (2015) Brief announcement: hypergraph partitioning for parallel sparse matrix-matrix multiplication. In: Proceedings of the 27th ACM on symposium on parallelism in algorithms and architectures, SPAA 2015, Portland, OR, USA, June 13\u201315, pp 86\u201388","DOI":"10.1145\/2755573.2755613"},{"key":"4121_CR4","doi-asserted-by":"publisher","unstructured":"Chen J, Li K, Bilal K, Metwally AA, Li K, Yu P (2018) Parallel protein community detection in large-scale ppi networks based on multi-source learning. IEEE\/ACM Trans Comput Biol Bioinform. \nhttps:\/\/doi.org\/10.1109\/TCBB.2018.2868088","DOI":"10.1109\/TCBB.2018.2868088"},{"key":"4121_CR5","doi-asserted-by":"publisher","unstructured":"Chen J, Li K, Bilal K, Zhou X, Li K, Yu P (2018) A bi-layered parallel training architecture for large-scale convolutional neural networks. IEEE Trans Parallel Distrib Syst. \nhttps:\/\/doi.org\/10.1109\/TPDS.2018.2877359","DOI":"10.1109\/TPDS.2018.2877359"},{"issue":"4","key":"4121_CR6","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1109\/TPDS.2016.2603511","volume":"28","author":"J Chen","year":"2018","unstructured":"Chen J, Li K, Tang Z, Bilal K, Yu S, Weng C, Li K (2018) A parallel random forest algorithm for big data in a spark cloud computing environment. IEEE Trans Parallel Distrib Syst 28(4):919\u2013933","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4121_CR7","doi-asserted-by":"publisher","unstructured":"Chen Y, Li K, Fei X, Quan Z, Li K (2018) Implementation and optimization of a data protecting model on the sunway taihulight supercomputer with heterogeneous many-core processors. Concurr Comput Pract Exp. \nhttps:\/\/doi.org\/10.1002\/cpe.4758","DOI":"10.1002\/cpe.4758"},{"key":"4121_CR8","doi-asserted-by":"publisher","unstructured":"Chen Y, Li K, Yang W, Xiao G, Xie X, Li T (2018) Performance-aware model for sparse matrix\u2013matrix multiplication on the sunway taihulight supercomputer. IEEE Trans Parallel Distrib Syst. \nhttps:\/\/doi.org\/10.1109\/TPDS.2018.2871189","DOI":"10.1109\/TPDS.2018.2871189"},{"key":"4121_CR9","unstructured":"Cheshmi K, Kamil S, Strout M.M, Dehnavi M.M (2018) Parsy: inspection and transformation of sparse matrix computations for parallelism. In: Proceedings of the international conference for high performance computing, networking, storage, and analysis, SC 2018, Dallas, TX, USA, November 11\u201316, 2018, pp 62:1\u201362:15"},{"key":"4121_CR10","unstructured":"Graf D, Labib K, Uznanski P (2018) Brief announcement: Hamming distance completeness and sparse matrix multiplication. In: 45th International colloquium on automata, languages, and programming, ICALP 2018, July 9\u201313, 2018, Prague, Czech Republic, pp 109:1\u2013109:4"},{"key":"4121_CR11","unstructured":"Greathouse JL, Daga M (2014) Efficient sparse matrix-vector multiplication on gpus using the CSR storage format. In: International conference for high performance computing, networking, storage and analysis, SC 2014, New Orleans, LA, USA, November 16\u201321, 2014, pp 769\u2013780"},{"key":"4121_CR12","doi-asserted-by":"crossref","unstructured":"Hong C, Sukumaran-Rajam A, Bandyopadhyay B, Kim J, Kurt SE, Nisa I, Sabhlok S, \u00c7ataly\u00fcrek \u00dcV, Parthasarathy S, Sadayappan P (2018) Efficient sparse-matrix multi-vector product on gpus. In: Proceedings of the 27th international symposium on high-performance parallel and distributed computing, HPDC 2018, Tempe, AZ, USA, June 11\u201315, 2018, pp 66\u201379","DOI":"10.1145\/3208040.3208062"},{"issue":"3","key":"4121_CR13","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/TKDE.2017.2767592","volume":"30","author":"R Kannan","year":"2018","unstructured":"Kannan R, Ballard G, Park H (2018) MPI-FAUN: an mpi-based framework for alternating\u2013updating nonnegative matrix factorization. IEEE Trans Knowl Data Eng 30(3):544\u2013558","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4121_CR14","doi-asserted-by":"crossref","unstructured":"Kaya O, Kannan R, Ballard G (2018) Partitioning and communication strategies for sparse non-negative matrix factorization. In: Proceedings of the 47th international conference on parallel processing, ICPP 2018, Eugene, OR, USA, August 13\u201316, 2018, pp 90:1\u201390:10","DOI":"10.1145\/3225058.3225127"},{"key":"4121_CR15","doi-asserted-by":"crossref","unstructured":"Kaya O, U\u00e7ar B (2015) Scalable sparse tensor decompositions in distributed memory systems. In: Proceedings of the international conference for high performance computing, networking, storage and analysis, SC 2015, Austin, TX, USA, November 15-20, 2015, pp 77:1\u201377:11","DOI":"10.1145\/2807591.2807624"},{"issue":"1","key":"4121_CR16","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TPDS.2014.2308221","volume":"26","author":"K Li","year":"2015","unstructured":"Li K, Yang W, Li K (2015) Performance analysis and optimization for spmv on GPU using probabilistic modeling. IEEE Trans Parallel Distrib Syst 26(1):196\u2013205","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10","key":"4121_CR17","doi-asserted-by":"publisher","first-page":"2795","DOI":"10.1109\/TPDS.2016.2516988","volume":"27","author":"K Li","year":"2016","unstructured":"Li K, Yang W, Li K (2016) A hybrid parallel solving algorithm on GPU for quasi-tridiagonal system of linear equations. IEEE Trans Parallel Distrib Syst 27(10):2795\u20132808","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4121_CR18","doi-asserted-by":"crossref","unstructured":"Liu C, Xie B, Liu X, Xue W, Yang H, Liu X (2018) Towards efficient spmv on sunway manycore architectures. In: Proceedings of the 32nd international conference on supercomputing, ICS 2018, Beijing, China, June 12\u201315, 2018, pp 363\u2013373","DOI":"10.1145\/3205289.3205313"},{"key":"4121_CR19","doi-asserted-by":"crossref","unstructured":"Liu J, He X, Liu W, Tan G (2018) Register-based implementation of the sparse general matrix\u2013matrix multiplication on gpus. In: Proceedings of the 23rd ACM SIGPLAN symposium on principles and practice of parallel programming, PPoPP 2018, Vienna, Austria, February 24\u201328, 2018, pp 407\u2013408","DOI":"10.1145\/3178487.3178529"},{"issue":"7","key":"4121_CR20","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1109\/TKDE.2016.2545664","volume":"28","author":"C Ordonez","year":"2016","unstructured":"Ordonez C, Zhang Y, Cabrera W (2016) The gamma matrix to summarize dense and sparse data sets for big data analytics. IEEE Trans Knowl Data Eng 28(7):1905\u20131918","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4121_CR21","doi-asserted-by":"crossref","unstructured":"Pal S, Beaumont J, Park D, Amarnath A, Feng S, Chakrabarti C, Kim H, Blaauw DT, Mudge TN, Dreslinski RG (2018) Outerspace: an outer product based sparse matrix multiplication accelerator. In: IEEE international symposium on high performance computer architecture, HPCA 2018, Vienna, Austria, February 24\u201328, 2018, pp 724\u2013736","DOI":"10.1109\/HPCA.2018.00067"},{"issue":"1","key":"4121_CR22","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/16M1062454","volume":"38","author":"G Pichon","year":"2017","unstructured":"Pichon G, Faverge M, Ramet P, Roman J (2017) Reordering strategy for blocking optimization in sparse linear solvers. SIAM J Matrix Anal Appl 38(1):226\u2013248","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"4121_CR23","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/16M1077398","volume":"38","author":"MT Schaub","year":"2017","unstructured":"Schaub MT, Trefois M, Dooren PV, Delvenne J (2017) Sparse matrix factorizations for fast linear solvers with application to laplacian systems. SIAM J Matrix Anal Appl 38(2):505\u2013529","journal-title":"SIAM J Matrix Anal Appl"},{"key":"4121_CR24","doi-asserted-by":"crossref","unstructured":"Sulatycke P, Ghose K (1998) Caching-efficient multithreaded fast multiplication of sparse matrices. In: IPPS\/SPDP, pp 117\u2013123","DOI":"10.1109\/IPPS.1998.669899"},{"key":"4121_CR25","doi-asserted-by":"crossref","unstructured":"Sun Q, Zhang C, Wu C, Zhang J, Li L (2018) Bandwidth reduced parallel spmv on the SW26010 many-core platform. In: Proceedings of the 47th international conference on parallel processing, ICPP 2018, Eugene, OR, USA, August 13\u201316, 2018, pp 54:1\u201354:10","DOI":"10.1145\/3225058.3225074"},{"key":"4121_CR26","unstructured":"Wang S, Liu J, Shroff NB (2018) Coded sparse matrix multiplication. In: Proceedings of the 35th international conference on machine learning, ICML 2018, Stockholmsm\u00e4ssan, Stockholm, Sweden, July 10\u201315, 2018, pp 5139\u20135147"},{"key":"4121_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.ins.2017.04.028","volume":"405","author":"G Xiao","year":"2017","unstructured":"Xiao G, Li K, Li K (2017) Reporting l most influential objects in uncertain databases based on probabilistic reverse top-k queries. Inf Sci 405:207\u2013226","journal-title":"Inf Sci"},{"issue":"3","key":"4121_CR28","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10619-014-7156-8","volume":"33","author":"G Xiao","year":"2015","unstructured":"Xiao G, Li K, Li K, Zhou X (2015) Efficient top-(k, l) range query processing for uncertain data based on multicore architectures. Distrib Parallel Databases 33(3):381\u2013413","journal-title":"Distrib Parallel Databases"},{"key":"4121_CR29","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jcss.2016.05.010","volume":"89","author":"G Xiao","year":"2017","unstructured":"Xiao G, Li K, Zhou X, Li K (2017) Efficient monochromatic and bichromatic probabilistic reverse top-k query processing for uncertain big data. J Comput Syst Sci 89:92\u2013113","journal-title":"J Comput Syst Sci"},{"issue":"9","key":"4121_CR30","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1109\/TC.2014.2366731","volume":"64","author":"W Yang","year":"2015","unstructured":"Yang W, Li K, Mo Z, Li K (2015) Performance optimization using partitioned spmv on gpus and multicore cpus. IEEE Trans Comput 64(9):2623\u20132636","journal-title":"IEEE Trans Comput"},{"key":"4121_CR31","doi-asserted-by":"crossref","unstructured":"Zhang J, Gruenwald L (2018) Regularizing irregularity: bitmap-based and portable sparse matrix multiplication for graph data on gpus. In: Proceedings of the 1st ACM SIGMOD joint international workshop on graph data management experiences and systems (GRADES) and network data analytics (NDA), Houston, TX, USA, June 10, 2018, pp 4:1\u20134:8","DOI":"10.1145\/3210259.3210263"},{"key":"4121_CR32","doi-asserted-by":"crossref","unstructured":"Zhao Y, Li J, Liao C, Shen X (2017) POSTER: bridging the gap between deep learning and sparse matrix format selection. In: 26th International conference on parallel architectures and compilation techniques, PACT 2017, Portland, OR, USA, September 9\u201313, 2017, pp 152\u2013153","DOI":"10.1109\/PACT.2017.33"},{"issue":"5","key":"4121_CR33","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1109\/TPDS.2016.2618791","volume":"28","author":"D Zheng","year":"2017","unstructured":"Zheng D, Mhembere D, Lyzinski V, Vogelstein JT, Priebe CE, Burns RC (2017) Semi-external memory sparse matrix multiplication for billion-node graphs. IEEE Trans Parallel Distrib Syst 28(5):1470\u20131483","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04121-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-019-04121-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04121-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T20:04:08Z","timestamp":1588277048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-019-04121-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,7]]},"references-count":33,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["4121"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04121-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2019,3,7]]},"assertion":[{"value":"9 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}