{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:28Z","timestamp":1725664288445},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603214"},{"type":"electronic","value":"9783540449157"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60321-2_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:18:10Z","timestamp":1330280290000},"page":"261-274","source":"Crossref","is-referenced-by-count":1,"title":["A reconfigurable parallel algorithm for sparse Cholesky factorization"],"prefix":"10.1007","author":[{"given":"A.","family":"Benaini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Laiymani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. R.","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1006\/jpdc.1994.1140","volume":"23","author":"J-M. Adamo","year":"1994","unstructured":"J-M. Adamo and L. Trejo. Programming Environment for Phase-reconfigurable Parallel Programming on Supernode. Journal of Parallel and Distributed Computing, 23:278\u2013292, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/00207169508804403","volume":"56","author":"A. Benaini","year":"1995","unstructured":"A. Benaini. The WW T factorization of dense and sparse matrices. Intern. J. Computer Math., 56:219\u2013229, 1995.","journal-title":"Intern. J. Computer Math."},{"key":"22_CR3","unstructured":"A. Benaini and D. Laiymani. A Multi-phase Gossip Procedure: Application to Matrices Factorization. In Int. Conf. Software for Multiprocessors and Supercomputers, pages 426\u2013434, 1994."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"A. Benaini and D. Laiymani. Parallel Block Generalized WZ Factorization on a Reconfigurable Machine. In Proc. of International Conference on Parallel and Distributed Systems. IEEE Computer Society, December 1994.","DOI":"10.1080\/10637199408962542"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"M. Cosnard. A comparison of parallel machine models from the point of view of scalability. In Proc. of MPCS'94, pages 258\u2013267. IEEE Computer Society, 1994.","DOI":"10.1109\/MPCS.1994.367069"},{"key":"22_CR6","unstructured":"F. Desprez. Proc\u00e9dure de Base pour le Calcul Scientifique sur Machines Parall\u00e8les a M\u00e9moire Distribu\u00e9e. PhD thesis, Institut National Polytechnique de Grenoble, 1994."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"I. Duff. Parallel implementation of multifrontal schemes. Parallel Computing, pages 193\u2013204, 1986.","DOI":"10.1016\/0167-8191(86)90019-0"},{"key":"22_CR8","unstructured":"A. George and J.W-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-8191(89)90101-4","volume":"10","author":"A. George","year":"1989","unstructured":"A. George, J.W-H Lui, and E. Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10:287\u2013298, 1989.","journal-title":"Parallel Computing"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/0909021","volume":"8","author":"J.A. George","year":"1988","unstructured":"J.A. George, M.T. Heath, J.W-H. Liu, and E.G-Y. Ng. Sparse Cholesky factorization on a local-memory multiprocessor. SIAM J. Sci. Statis. Comput., 8:327\u2013340, 1988.","journal-title":"SIAM J. Sci. Statis. Comput."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"J.A. George","year":"1978","unstructured":"J.A. George and J.W-H. Lui. An Automatic Nested Dissection Algorithm of Irregular Finite Element Problems. SIAM J. Numerical Analysis, 15:1053\u20131069, 1978.","journal-title":"SIAM J. Numerical Analysis"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/355900.355906","volume":"6","author":"J.A. George","year":"1980","unstructured":"J.A. George and J.W-H. Lui. A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs. ACM Trans. Math. Software, 6:337\u2013358, 1980.","journal-title":"ACM Trans. Math. Software"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"A. Gupta and V. Kumar. A Scalable Parallel Algorithm for Sparse Cholesky Factorization. In Proc. of Supercomputing '94, 1994.","DOI":"10.1145\/602770.602898"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"M. Hahad, J. Erhel, and T. Priol. A New Approach to Parallel Sparse Cholesky Factorization on Distributed Memory Parallel Computers. Technical Report 2081, INRIA, 1993.","DOI":"10.1109\/ICPP.1994.177"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W-H. Liu","year":"1990","unstructured":"J.W-H. Liu. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl., 11:134\u2013172, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR16","volume-title":"Technical Report 91-54","author":"A. Gupta","year":"1991","unstructured":"A. Gupta nad V. Kumar. Analysing Scalability of Parallel Algorithms and Architectures. Technical Report 91-54, Department of Computer Science-University of Minnesota-Minneapolis, 1991."},{"key":"22_CR17","unstructured":"A. Pothen. The Complexity of Optimal Elimination Trees. Technical Report CS-88-16, Pennsylvania State University, 1988."},{"key":"22_CR18","first-page":"115","volume":"6","author":"J. Roman","year":"1994","unstructured":"J. Roman. Partitionnement algorithmique des donn\u00e9es pour la factorization de cholesky par bloc de grands syst\u00e8mes lin\u00e9aires creux sur des calculateurs mimd. Calculateurs Parall\u00e8les, 6:115\u2013120, 1994.","journal-title":"Calculateurs Parall\u00e8les"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"E. Rothberg. Performance of panel and block approaches to sparse Cholesky factorization on the ipsc\/860 and paragon multicomputers. In Proceedings of the 1994 Scalable High Performance Computing Conference, May 1994.","DOI":"10.1109\/SHPCC.1994.296661"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"E. Rothberg and A. Gupta. A efficient block-oriented approach to parallel sparse Cholesky factorization. In Supercomputong '92 Proceedings, 1992.","DOI":"10.1145\/169627.169791"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms for Irregularly Structured Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60321-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:59:02Z","timestamp":1687287542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60321-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603214","9783540449157"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60321-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}