{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:16Z","timestamp":1750309156297,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T00:00:00Z","timestamp":1710115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2021YFB0300800"],"award-info":[{"award-number":["2021YFB0300800"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Program of National Natural Science Foundation of China","award":["U21A20461, 92055213, 62227808"],"award-info":[{"award-number":["U21A20461, 92055213, 62227808"]}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province, China","doi-asserted-by":"crossref","award":["2021JJ50158"],"award-info":[{"award-number":["2021JJ50158"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Projects of Xiangjiang Laboratory","award":["22xj01011"],"award-info":[{"award-number":["22xj01011"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Parallel Comput."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>\n            Sparse supernodal Cholesky on multi-NUMAs is challenging due to the supernode relaxation and load balancing. In this work, we propose a novel approach to improve the performance of sparse Cholesky by combining deep learning with a relaxation parameter and a hierarchical parallelization strategy with NUMA affinity. Specifically, our relaxed supernodal algorithm utilizes a well-trained GCN model to adaptively adjust relaxation parameters based on the sparse matrix\u2019s structure, achieving a proper balance between task-level parallelism and dense computational granularity. Additionally, the hierarchical parallelization maps supernodal tasks to the local NUMA parallel queue and updates contribution blocks in pipeline mode. Furthermore, the stream scheduling with NUMA affinity can further enhance the efficiency of memory access during the numerical factorization. The experimental results show that HPS Cholesky can outperform state-of-the-art libraries, such as Eigen\n            <jats:italic>\n              LL\n              <jats:sup>T<\/jats:sup>\n            <\/jats:italic>\n            , CHOLMOD, PaStiX and SuiteSparse on 79.78%, 79.60%, 82.09% and 74.47% of 1,128 datasets. It achieves an average speedup of 1.41x over the current optimal relaxation algorithm. Moreover, 70.83% of matrices have surpassed MKL sparse Cholesky on Xeon Gold 6248.\n          <\/jats:p>","DOI":"10.1145\/3630051","type":"journal-article","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T21:47:37Z","timestamp":1698356857000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["HPS Cholesky: Hierarchical Parallelized Supernodal Cholesky with Adaptive Parameters"],"prefix":"10.1145","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3329-0924","authenticated-orcid":false,"given":"Shengle","family":"Lin","sequence":"first","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2681-7898","authenticated-orcid":false,"given":"Wangdong","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4510-5979","authenticated-orcid":false,"given":"Yikun","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7642-457X","authenticated-orcid":false,"given":"Qinyun","family":"Cai","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1913-8152","authenticated-orcid":false,"given":"Minlu","family":"Dai","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0086-6301","authenticated-orcid":false,"given":"Haotian","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,3,11]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.01.110"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/76909.76910"},{"key":"e_1_3_1_4_2","volume-title":"PPSC","author":"Ashcraft Cleve","year":"1999","unstructured":"Cleve Ashcraft and Roger G. Grimes. 1999. SPOOLES: An object-oriented sparse matrix library. In PPSC."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(94)90005-1"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2042901"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2011.2164148"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/2971808.2972177"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897321076"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899357346"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1462173.1462176"},{"issue":"1","key":"e_1_3_1_13_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2049662.2049663","article-title":"The University of Florida Sparse Matrix Collection","volume":"38","author":"Davis Timothy A.","year":"2011","unstructured":"Timothy A. Davis and Yifan Hu. 2011. The University of Florida Sparse Matrix Collection. ACM Transactions on Mathematical Software (TOMS) 38, 1 (2011), 1\u201325.","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895291765"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897317685"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57172-5_3"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/77626.77627"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/77626.79170"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/0905045"},{"key":"e_1_3_1_21_2","volume-title":"Software for Sparse Gaussian Elimination with Limited Core Storage.","author":"Eisenstat Stanley C.","year":"1978","unstructured":"Stanley C. Eisenstat, Martin H. Schultz, and Andrew H. Sherman. 1978. Software for Sparse Gaussian Elimination with Limited Core Storage.Technical Report. Yale Univ. New Haven Conn. Dept. of Computer Science."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236465"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00141-7"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1137\/090757216"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00525"},{"key":"e_1_3_1_26_2","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016).","journal-title":"arXiv preprint arXiv:1609.02907"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3184970"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3268215"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476199"},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","unstructured":"Jiaxiang Liu Jin Hao Hangzheng Lin Wei Pan Jianfei Yang Yang Feng Gaoang Wang Jin Li Zuolin Jin Zhihe Zhao and Zuozhu Liu. 2023. Deep learning-enabled 3D multimodal fusion of cone-beam CT and intraoral mesh scans for clinically applicable tooth-bone reconstruction. Patterns 4 9 (2023).","DOI":"10.1016\/j.patter.2023.100825"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/103147.103159"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1137\/1034004"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/0614019"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_1_36_2","article-title":"Hyper-graph-network decoders for block codes","volume":"32","author":"Nachmani Eliya","year":"2019","unstructured":"Eliya Nachmani and Lior Wolf. 2019. Hyper-graph-network decoders for block codes. Advances in Neural Information Processing Systems 32 (2019).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2018.06.007"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2016.06.004"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1137\/S106482759426715X"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(01)00135-1"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.5555\/514474.514480"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3145617.3145620"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/CAHPC.2018.8645938"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2021.3054584"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2935152"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2424684"}],"container-title":["ACM Transactions on Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3630051","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3630051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:56Z","timestamp":1750287056000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3630051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,11]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3630051"],"URL":"https:\/\/doi.org\/10.1145\/3630051","relation":{},"ISSN":["2329-4949","2329-4957"],"issn-type":[{"type":"print","value":"2329-4949"},{"type":"electronic","value":"2329-4957"}],"subject":[],"published":{"date-parts":[[2024,3,11]]},"assertion":[{"value":"2022-11-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}