{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335932,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Key Program of National Natural Science Foundation of China","award":["92055213"],"award-info":[{"award-number":["92055213"]}]},{"name":"the National Natural Science Foundation of China","award":["61872127,61751204"],"award-info":[{"award-number":["61872127,61751204"]}]},{"name":"the National Key R&D Program of China","award":["2018YFB0204302"],"award-info":[{"award-number":["2018YFB0204302"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,14]]},"DOI":"10.1145\/3458817.3476199","type":"proceedings-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T05:10:34Z","timestamp":1634793034000},"page":"1-14","source":"Crossref","is-referenced-by-count":5,"title":["STM-multifrontal QR"],"prefix":"10.1145","author":[{"given":"Shengle","family":"Lin","sequence":"first","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wangdong","family":"Yang","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haotian","family":"Wang","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinyun","family":"Tsai","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","article-title":"An approximate minimum degree ordering algorithm","volume":"17","author":"Amestoy Patrick R","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl."},{"volume-title":"Multifrontal QR factorization in a multiprocessor environment. Numerical linear algebra with applications 3, 4","year":"1996","author":"Amestoy Patrick R","key":"e_1_3_2_2_2_1"},{"volume-title":"2011 IEEE International Parallel & Distributed Processing Symposium. IEEE, 48--58","year":"2011","author":"Anderson Michael","key":"e_1_3_2_2_3_1"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/76909.76910","article-title":"The influence of relaxed supernode partitions on the multifrontal method","volume":"15","author":"Ashcraft Cleve","year":"1989","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","first-page":"C323","DOI":"10.1137\/110846427","article-title":"Fine-grained multithreading for the multifrontal QR factorization of sparse matrices","volume":"35","author":"Buttari Alfredo","year":"2013","journal-title":"SIAM Journal on Scientific Computing"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1137\/19M123806X","article-title":"An algebraic sparsified nested dissection algorithm using low-rank approximations","volume":"41","author":"Cambier L\u00e9opold","year":"2020","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/TCAD.2010.2042901","article-title":"A parallel direct solver for the simulation of large-scale power\/ground networks","volume":"29","author":"Cauley Stephen","year":"2010","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/5925.5932","article-title":"Predicting fill for sparse orthogonal factorization","volume":"33","author":"Coleman Thomas F","year":"1986","journal-title":"Journal of the ACM (JACM)"},{"volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 984--987","year":"2019","author":"Cui Ganqu","key":"e_1_3_2_2_9_1"},{"key":"e_1_3_2_2_10_1","unstructured":"Scott Cyphers Arjun K Bansal Anahita Bhiwandiwalla Jayaram Bobba Matthew Brookhart Avijit Chakraborty Will Constable Christian Convey Leona Cook Omar Kanawi etal 2018. Intel ngraph: An intermediate representation compiler and executor for deep learning. arXiv preprint arXiv:1801.08058 (2018). Scott Cyphers Arjun K Bansal Anahita Bhiwandiwalla Jayaram Bobba Matthew Brookhart Avijit Chakraborty Will Constable Christian Convey Leona Cook Omar Kanawi et al. 2018. Intel ngraph: An intermediate representation compiler and executor for deep learning. arXiv preprint arXiv:1801.08058 (2018)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2049662.2049670","article-title":"Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization","volume":"38","author":"Davis Timothy A","year":"2011","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/1024074.1024080","article-title":"Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm","volume":"30","author":"Davis Timothy A","year":"2004","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1145\/592843.592848","article-title":"A software package for sparse orthogonal factorization and updating","volume":"28","author":"Edlund Ove","year":"2002","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"volume-title":"2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC). IEEE Computer Society, 1041--1054","year":"2020","author":"Eswar Srinivas","key":"e_1_3_2_2_14_1"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2513109.2513116","article-title":"Algorithm 933: Reliable calculation of numerical rank, null space bases, pseudoinverse solutions, and basic solutions using SuiteSparseQR","volume":"40","author":"Foster Leslie V","year":"2013","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","DOI":"10.1109\/72.712151","volume-title":"A general framework for adaptive processing of data structures","author":"Frasconi Paolo","year":"1998"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90159-7"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0909008","article-title":"A data structure for sparse QR and LU factorizations","volume":"9","author":"George Alan","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"volume-title":"The evolution of the minimum degree ordering algorithm. Siam review 31, 1","year":"1989","author":"George Alan","key":"e_1_3_2_2_19_1"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","first-page":"S358","DOI":"10.1137\/15M1010117","article-title":"An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling","volume":"38","author":"Ghysels Pieter","year":"2016","journal-title":"SIAM Journal on Scientific Computing"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1023\/A:1021943902025","article-title":"Computing row and column counts for sparse QR and LU factorization","volume":"41","author":"Gilbert John R","year":"2001","journal-title":"BIT Numerical Mathematics"},{"volume-title":"Hierarchical Orthogonal Factorization: Sparse Square matrices. arXiv preprint arXiv:2010.06807","year":"2020","author":"Gnanasekaran Abeynaya","key":"e_1_3_2_2_22_1"},{"volume-title":"Matrix computations","author":"Golub Gene H","key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944"},{"key":"e_1_3_2_2_24_1","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob etal 2010. Eigen v3. http:\/\/eigen.tuxfamily.org. Ga\u00ebl Guennebaud Beno\u00eet Jacob et al. 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"volume-title":"A comprehensive foundation. Neural networks 2","year":"2004","author":"Haykin Simon","key":"e_1_3_2_2_25_1"},{"volume-title":"A pipelined Givens method for computing the QR factorization of a sparse matrix. Linear algebra and its applications 77","year":"1986","author":"Heath MT","key":"e_1_3_2_2_26_1"},{"key":"e_1_3_2_2_27_1","series-title":"SIAM journal on scientific and statistical computing 7, 4","volume-title":"On general row merging schemes for sparse Givens transformations","author":"Liu Joseph WH","year":"1986"},{"key":"e_1_3_2_2_28_1","series-title":"SIAM review 34, 1","volume-title":"The multifrontal method for sparse matrix solution: Theory and practice","author":"Liu Joseph WH","year":"1992"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/0167-8191(94)00092-O","article-title":"Parallel sparse QR factorization on shared memory architectures","volume":"21","author":"Matstoms Pontus","year":"1995","journal-title":"Parallel Comput."},{"key":"e_1_3_2_2_30_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"33","author":"Morris Christopher","year":"2019"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/S0895479893244353","article-title":"Sparse multifrontal rank revealing QR factorization","volume":"18","author":"Pierce Daniel J","year":"1997","journal-title":"SIAM J. Matrix Anal. Appl."},{"volume-title":"TBB on NUMA Architectures","author":"Voss Michael","key":"e_1_3_2_2_32_1"},{"volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122","author":"Wang Endong","key":"e_1_3_2_2_33_1"},{"volume-title":"Proceedings of the Workshop on Memory Centric Programming for HPC. 30--34","year":"2017","author":"Williams Sean","key":"e_1_3_2_2_34_1"},{"volume-title":"A comprehensive survey on graph neural networks","year":"2020","author":"Wu Zonghan","key":"e_1_3_2_2_35_1"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the minimum fill-in is NP-complete","volume":"2","author":"Yannakakis Mihalis","year":"1981","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3065870","article-title":"Algorithm 980: Sparse QR factorization on the GPU","volume":"44","author":"Yeralan Sencer Nuri","year":"2017","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"volume-title":"Graph neural networks: A review of methods and applications. arXiv preprint arXiv:1812.08434","year":"2018","author":"Zhou Jie","key":"e_1_3_2_2_38_1"}],"event":{"name":"SC '21: The International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"],"location":"St. Louis Missouri","acronym":"SC '21"},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458817.3476199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458817.3476199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458817.3476199"}},"subtitle":["streaming task mapping multifrontal QR factorization empowered by GCN"],"short-title":[],"issued":{"date-parts":[[2021,11,13]]},"references-count":38,"alternative-id":["10.1145\/3458817.3476199","10.1145\/3458817"],"URL":"https:\/\/doi.org\/10.1145\/3458817.3476199","relation":{},"subject":[],"published":{"date-parts":[[2021,11,13]]}}}