{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:24:02Z","timestamp":1759134242294},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,2,24]],"date-time":"2007-02-24T00:00:00Z","timestamp":1172275200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2007,5,2]]},"DOI":"10.1007\/s00200-007-0036-y","type":"journal-article","created":{"date-parts":[[2007,2,23]],"date-time":"2007-02-23T11:59:17Z","timestamp":1172231957000},"page":"241-261","source":"Crossref","is-referenced-by-count":3,"title":["Towards an accurate performance modeling of parallel sparse factorization"],"prefix":"10.1007","volume":"18","author":[{"given":"Laura","family":"Grigori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoye S.","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,2,24]]},"reference":[{"issue":"5","key":"36_CR1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1147\/rd.385.0563","volume":"38","author":"R.C. Agarwal","year":"1994","unstructured":"Agarwal R.C., Gustavson F.G. and Zubair M. (1994). Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM J. Res. Develop. 38(5): 563\u2013576","journal-title":"IBM J. Res. Develop."},{"key":"36_CR2","unstructured":"Andersson, S., Bell, R., Hague, J., Holthoff, H., Mayes, P., Nakano, J., Shieh, D., Tuccillo, J.: RS\/6000 Scientific and Technical Computing: POWER3 Introduction and Tuning Guide. International Business Machines (1998) http:\/\/www.redbooks.ibm.com."},{"key":"36_CR3","first-page":"159","volume-title":"Graph Theory and Sparse Matrix Computation","author":"C. Ashcraft","year":"1994","unstructured":"Ashcraft C. (1994). The fan-both family of column-based distributed Cholesky factorization algorithms. In: George, A., Gilbert, J.R. and Liu, J.W.H. (eds) Graph Theory and Sparse Matrix Computation, pp 159\u2013191. Springer, Berlin"},{"issue":"3","key":"36_CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1177\/109434200001400303","volume":"14","author":"S. Browne","year":"2000","unstructured":"Browne S., Dongarra J., Garner N., Ho G. and Mucci P. (2000). A portable programming interface for performance evaluation on modern processors. Int. J. High Perfor. Comput. Appl. 14(3): 189\u2013204","journal-title":"Int. J. High Perfor. Comput. Appl."},{"key":"36_CR5","unstructured":"Davis, T.: University of Florida Sparse Matrix Collection. NA Digest, vol. 92, no. 42, October 16, 1994, NA Digest, vol. 96, no. 28, July 23, 1996, and NA Digest, vol. 97, no. 23, June 7, 1997 http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Grigori, L., Li, X.S.: Performance analysis of parallel right-looking sparse LU factorization on two-dimensional grid of processors. In: Proceedings of PARA\u201904 Workshop on State-of-the-art in Scientific Computing, LNCS 3732, pp. 768\u2013777 (2006)","DOI":"10.1007\/11558958_93"},{"issue":"5","key":"36_CR7","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/71.598277","volume":"8","author":"A. Gupta","year":"1997","unstructured":"Gupta A., Karypis G. and Kumar V. (1997). Highly Scalable Parallel Algorithms for Sparse Matrix Factorization. IEEE Trans. Parallel Distrib. Syst. 8(5): 502\u2013520","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"36_CR8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/292395.292412","volume":"24","author":"B. K\u00e5lgstr\u00f6m","year":"1998","unstructured":"K\u00e5lgstr\u00f6m B., Ling P. and Van Loan C. (1998). GEMM-Based Level 3 BLAS: model implementations and performance evaluation benchmark. ACM Trans. Math. Softw. 24(3): 268\u2013302","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"36_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/292395.292426","volume":"24","author":"B. K\u00e5lgstr\u00f6m","year":"1998","unstructured":"K\u00e5lgstr\u00f6m B., Ling P. and Van Loan C. (1998). GEMM-based level 3 BLAS: portability and optimization issues. ACM Trans. Math. Softw. 24(3): 303\u2013316","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"36_CR10","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1145\/779359.779361","volume":"29","author":"X.S. Li","year":"2003","unstructured":"Li X.S. and Demmel J.W. (2003). SuperLU_DIST: a scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans. Math. Softw. 29(2): 110\u2013140","journal-title":"ACM Trans. Math. Softw."},{"key":"36_CR11","first-page":"191","volume-title":"Graph Theory and Sparse Matrix Computation","author":"R. Schreiber","year":"1994","unstructured":"Schreiber R. (1994). Scalability of sparse direct solvers. In: George, A., Gilbert, J.R. and Liu, J.W.H. (eds) Graph Theory and Sparse Matrix Computation, pp 191\u2013211. Springer, Berlin"},{"key":"36_CR12","unstructured":"Skinner, D.: IBM SP Parallel Scaling Overview. http:\/\/www.nersc.gov\/news\/reports\/technical\/seaborg_scaling"},{"key":"36_CR13","unstructured":"Vuduc, R., Kamil, S., Hsu, J., Nishtala, R., Demmel, J.W., Yellick, K.A.: Automatic tuning and analysis of sparse triangular solve. In: ICS 2002: Workshop on Performance via High-Level Languages and Libraries (2002)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-007-0036-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-007-0036-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-007-0036-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:20Z","timestamp":1558610660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-007-0036-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,24]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5,2]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s00200-007-0036-y","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,24]]}}}