{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T19:21:15Z","timestamp":1778181675557,"version":"3.51.4"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Key Program of National Natural Science Foundation of China","award":["61432005"],"award-info":[{"award-number":["61432005"]}]},{"name":"National Key R8D Program of China","award":["2018YFB1003401"],"award-info":[{"award-number":["2018YFB1003401"]}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province, China","doi-asserted-by":"crossref","award":["2018JJ2022"],"award-info":[{"award-number":["2018JJ2022"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872127, 61572175, 61751204, and 61472124"],"award-info":[{"award-number":["61872127, 61572175, 61751204, and 61472124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Outstanding Youth Science Program of National Natural Science Foundation of China","award":["61625202"],"award-info":[{"award-number":["61625202"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2019,12,31]]},"abstract":"<jats:p>Tensors have drawn a growing attention in many applications, such as physics, engineering science, social networks, recommended systems. Tensor decomposition is the key to explore the inherent intrinsic data relationship of tensor. There are many sparse tensor and vector multiplications (SpTV) in tensor decomposition. We analyze a variety of storage formats of sparse tensors and develop a piecewise compression strategy to improve the storage efficiency of large sparse tensors. This compression strategy can avoid storing a large number of empty slices and empty fibers in sparse tensors, and thus the storage space is significantly reduced. A parallel algorithm for the SpTV based on the high-order compressed format based on slices is designed to greatly improve its computing performance on graphics processing unit. Each tensor is cut into multiple slices to form a series of sparse matrix and vector multiplications, which form the pipelined parallelism. The transmission time of the slices can be hidden through pipelined parallel to further optimize the performance of the SpTV.<\/jats:p>","DOI":"10.1145\/3363575","type":"journal-article","created":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T21:41:21Z","timestamp":1573594881000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A Pipeline Computing Method of SpTV for Three-Order Tensors on CPU and GPU"],"prefix":"10.1145","volume":"13","author":[{"given":"Wangdong","family":"Yang","sequence":"first","affiliation":[{"name":"Hunan University and Hunan City University, Yiyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqin","family":"Li","sequence":"additional","affiliation":[{"name":"Hunan University and State University of New York, NY, US"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"C. J. Appellof and E. R. Davidson. 1983. Three-dimensional rank annihilation for multi-component determinations. Analytica Chimica Acta 146 FEB (1983) 9--14.  C. J. Appellof and E. R. Davidson. 1983. Three-dimensional rank annihilation for multi-component determinations. Analytica Chimica Acta 146 FEB (1983) 9--14.","DOI":"10.1016\/S0003-2670(00)80587-5"},{"key":"e_1_2_1_2_1","volume-title":"Kolda","author":"Bader Brett W.","year":"2015"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1198\/tech.2005.s322"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Guillaume Bouchard Jason Naradowsky Sebastian Riedel Tim Rockt\u00e4schel and Andreas Vlachos. 2015. Matrix and tensor factorization methods for natural language processing. In Tutorials. 16--18.  Guillaume Bouchard Jason Naradowsky Sebastian Riedel Tim Rockt\u00e4schel and Andreas Vlachos. 2015. Matrix and tensor factorization methods for natural language processing. In Tutorials. 16--18.","DOI":"10.3115\/v1\/P15-5005"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(97)00032-4"},{"key":"e_1_2_1_6_1","first-page":"231","article-title":"Multi-way analysis in the food industry. Models, algorithms, and applications","volume":"6","author":"Bro Rasmus","year":"1998","journal-title":"Ethical Theory and Moral Practice"},{"key":"e_1_2_1_7_1","volume-title":"Second workshop on information heterogeneity and fusion in recommender systems (HetRec 2011). In 5th ACM Conference on Recommender Systems (RecSys\u201911)","author":"Cantador Iv\u00e1n","year":"2011"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288739"},{"key":"e_1_2_1_10_1","unstructured":"Joon Hee Choi and S. V. N. Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In Advances in Neural Information Processing Systems. 1296--1304.  Joon Hee Choi and S. V. N. Vishwanathan. 2014. DFacTo: Distributed factorization of tensors. In Advances in Neural Information Processing Systems. 1296--1304."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"e_1_2_1_12_1","series-title":"Working Papers in Phonetics No. 16","volume-title":"Multimode Factor Analysis","author":"Harshman R. A."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1021\/jp034596z"},{"key":"e_1_2_1_14_1","first-page":"1","article-title":"The expression of a tensor or a polyadic as a sum of products","volume":"6","author":"Hitchcock Frank L.","year":"1927","journal-title":"Studies in Applied Mathematics"},{"key":"e_1_2_1_15_1","unstructured":"Richard Vuduc Jiajia Li Yuchen Ma. 2017. ParTI! : A Parallel Tensor Infrastructure. Retrieved from https:\/\/github.com\/hpcgarage\/ParTI.  Richard Vuduc Jiajia Li Yuchen Ma. 2017. ParTI! : A Parallel Tensor Infrastructure. Retrieved from https:\/\/github.com\/hpcgarage\/ParTI."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339583"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80175"},{"key":"e_1_2_1_18_1","unstructured":"Donald E. Knuth. 1973. The Art of Computer Programming: Seminumerical Algorithms. Pearson Schweiz AG.  Donald E. Knuth. 1973. The Art of Computer Programming: Seminumerical Algorithms. Pearson Schweiz AG."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_2_1_20_1","volume-title":"4th IMA International Conference on Mathematics in Signal Processing. 1--15","author":"De Lathauwer L."},{"key":"e_1_2_1_21_1","unstructured":"Jiajia Li Yuchen Ma Chenggang Yan and Richard Vuduc. 2017. Optimizing sparse tensor times matrix on multi-core and many-core architectures. In Irregular Applications: Architecture and Algorithms. 26--33.  Jiajia Li Yuchen Ma Chenggang Yan and Richard Vuduc. 2017. Optimizing sparse tensor times matrix on multi-core and many-core architectures. In Irregular Applications: Architecture and Algorithms. 26--33."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2308221"},{"key":"e_1_2_1_23_1","volume-title":"IEEE International Conference on Cluster Computing (CLUSTER\u201917)","author":"Liu Bangtian"},{"key":"e_1_2_1_24_1","volume-title":"White","author":"Matthew Fishman","year":"2017"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2017.2732685"},{"key":"e_1_2_1_26_1","volume-title":"NVIDIA CUDA C Programming Guide","author":"NVIDIA."},{"key":"e_1_2_1_27_1","volume-title":"Bhavaraju","author":"Osorio Ivan","year":"2013"},{"key":"e_1_2_1_28_1","volume-title":"Sidiropoulos","author":"Papalexakis Evangelos E.","year":"2012"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2017.02.016"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-007-0031-4"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557100"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"e_1_2_1_33_1","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing. 1--5.","author":"Sidiropoulos N. D."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329196"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.27"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA580199"},{"key":"e_1_2_1_37_1","unstructured":"P. A. Tew. 2016. An Investigation of Sparse Tensor Formats for Tensor Libraries. Retrieved from http:\/\/groups.csail.mit.edu\/commit\/papers\/2016\/parker-thesis.pdf.  P. A. Tew. 2016. An Investigation of Sparse Tensor Formats for Tensor Libraries. Retrieved from http:\/\/groups.csail.mit.edu\/commit\/papers\/2016\/parker-thesis.pdf."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_2_1_39_1","unstructured":"Sorber L. Van Barel M. Vervliet N. Debals O. and De Lathauwer L. 2016. MATLAB Tensorlab Version 3.0. Retrieved from https:\/\/www.tensorlab.net\/.  Sorber L. Van Barel M. Vervliet N. Debals O. and De Lathauwer L. 2016. MATLAB Tensorlab Version 3.0. Retrieved from https:\/\/www.tensorlab.net\/."},{"key":"e_1_2_1_40_1","volume-title":"Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions. https:\/\/arxiv.org\/abs\/1802.04730.","author":"Vasilache Nicolas","year":"2018"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783395"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.09.010"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2366731"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings IEEE International Conference on Big Data (Big Data\u201918)","author":"Yanzhao Wu","year":"2018"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3363575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3363575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:26Z","timestamp":1750203866000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3363575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12,31]]}},"alternative-id":["10.1145\/3363575"],"URL":"https:\/\/doi.org\/10.1145\/3363575","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"2018-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}