{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T21:40:02Z","timestamp":1733866802188,"version":"3.30.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0167-8191(02)00162-x","type":"journal-article","created":{"date-parts":[[2002,10,21]],"date-time":"2002-10-21T15:29:59Z","timestamp":1035214199000},"page":"1507-1530","source":"Crossref","is-referenced-by-count":1,"title":["QR factorization for shared memory and message passing"],"prefix":"10.1016","volume":"28","author":[{"given":"Ian N","family":"Dunn","sequence":"first","affiliation":[]},{"given":"Gerard G.L","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1997","series-title":"ScaLAPACK user\u2019s guide","author":"Blackford","key":"10.1016\/S0167-8191(02)00162-X_BIB1"},{"key":"10.1016\/S0167-8191(02)00162-X_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018970413988","article-title":"A parameterized ordering for cache-, register- and pipeline-efficient Givens qr decomposition","volume":"10","author":"Carrig","year":"1999","journal-title":"Adv. Comp. Math."},{"key":"10.1016\/S0167-8191(02)00162-X_BIB3","doi-asserted-by":"crossref","unstructured":"J. Choi, J.J. Dongarra, L.S. Ostrouchov, A.P. Petitet, D.W. Walker, R.C. Whaley, The design and implementation of the scalapack lu, qr, and cholesky factorization routines, Technical Report TM-12470, Oak Ridge National Laboratory, Oak Ridge, TN, 1994","DOI":"10.1155\/1996\/483083"},{"issue":"6","key":"10.1016\/S0167-8191(02)00162-X_BIB4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1023\/A:1025168022993","article-title":"Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs","volume":"253","author":"Darte","year":"1997","journal-title":"Int. J. Parallel Prog."},{"year":"1989","series-title":"Matrix Computations","author":"Golub","key":"10.1016\/S0167-8191(02)00162-X_BIB5"},{"issue":"3","key":"10.1016\/S0167-8191(02)00162-X_BIB6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1011602732570","article-title":"A framework for efficient data redistribution on distributed memory multicomputers","volume":"20","author":"Guo","year":"2001","journal-title":"J. Supercomput."},{"year":"1993","series-title":"Advanced computer architecture: parallelism scalability, programmability","author":"Hwang","key":"10.1016\/S0167-8191(02)00162-X_BIB7"},{"key":"10.1016\/S0167-8191(02)00162-X_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/52.1991","article-title":"Grain size determination for parallel processing","author":"Kruatrachue","year":"1988","journal-title":"IEEE Software"},{"issue":"3\u20134","key":"10.1016\/S0167-8191(02)00162-X_BIB9","article-title":"Maximizing parallelism and minimizing synchronization with affine transforms","volume":"24","author":"Lim","year":"1998","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(02)00162-X_BIB10","unstructured":"Message Passing Interface Forum, Mpi: a message passing interface standard, Technical report, Univ. of Tennessee, Knoxville, TN, 1997"},{"key":"10.1016\/S0167-8191(02)00162-X_BIB11","doi-asserted-by":"crossref","unstructured":"R.S. Nikhil, Arvind, Can dataflow subsume von neumann computing, in: 16th International Symposium on Compute Architecture, 1989, pp. 262\u2013272","DOI":"10.1109\/ISCA.1989.714561"},{"issue":"12","key":"10.1016\/S0167-8191(02)00162-X_BIB12","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1109\/71.819945","article-title":"Efficient algorithms for block-cyclic array redistribution between processor sets","volume":"10","author":"Park","year":"1999","journal-title":"IEEE Trans. Parallel Distr. Comput."},{"issue":"12","key":"10.1016\/S0167-8191(02)00162-X_BIB13","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/71.819944","article-title":"Algorithm redistribution methods for block-cyclic decompositions","volume":"10","author":"Petit","year":"1999","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"issue":"3","key":"10.1016\/S0167-8191(02)00162-X_BIB14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1147\/rd.413.0233","article-title":"Automatic selection of high-order transformations in the ibm xl fortran compilers","volume":"41","author":"Sarkar","year":"1997","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0167-8191(02)00162-X_BIB15","unstructured":"C. Van Loan, A block factorization scheme for loosely coupled systems of array processors, Technical Report TR86-797, Cornell University, Computer Science, Cornell, NY, 1986"},{"key":"10.1016\/S0167-8191(02)00162-X_BIB16","unstructured":"M.E. Wolf, Improving locality and parallelism in nested loops, PhD thesis, Stanford University, 1992"},{"issue":"4","key":"10.1016\/S0167-8191(02)00162-X_BIB17","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/71.97902","article-title":"A loop transformation theory and algorithm to maximize parallelism","volume":"2","author":"Wolf","year":"1991","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"year":"1996","series-title":"High Performance Compilers for Parallel Computing","author":"Wolfe","key":"10.1016\/S0167-8191(02)00162-X_BIB18"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200162X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200162X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T21:15:50Z","timestamp":1733865350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781910200162X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":18,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S016781910200162X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00162-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}