{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:37:54Z","timestamp":1648622274219},"reference-count":14,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":[[2001,9]]},"DOI":"10.1016\/s0167-8191(01)00087-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:37:03Z","timestamp":1027615023000},"page":"1321-1345","source":"Crossref","is-referenced-by-count":2,"title":["Load balanced parallel QR decomposition on shared memory multiprocessors"],"prefix":"10.1016","volume":"27","author":[{"given":"Jeff","family":"Boleng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manavendra","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(01)00087-4_BIB1","unstructured":"J. Boleng, Parallel qr decomposition for electromagnetic scattering problems, Master's thesis, Department of MCS, Colorado School of Mines, July 1997"},{"key":"10.1016\/S0167-8191(01)00087-4_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1155\/1996\/483083","article-title":"The design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines","volume":"5","author":"Choi","year":"1996","journal-title":"Scient. Programm."},{"issue":"1","key":"10.1016\/S0167-8191(01)00087-4_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/99.590858","article-title":"Emulating shared memory to simplify distributed-memory programming","volume":"4","author":"Clarke","year":"1997","journal-title":"IEEE Comput. Sci. Eng."},{"issue":"2","key":"10.1016\/S0167-8191(01)00087-4_BIB4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/4434.588280","article-title":"Vote for peace: Implementation and performance of a parallel operating system","volume":"5","author":"Cordsen","year":"1997","journal-title":"IEEE Concurrency"},{"key":"10.1016\/S0167-8191(01)00087-4_BIB5","first-page":"549","article-title":"Complexit\u00e9 de la factorisation QR en parall\u00e8le","volume":"297A","author":"Cosnard","year":"1983","journal-title":"C.R. Acad. Sci. Paris"},{"issue":"2","key":"10.1016\/S0167-8191(01)00087-4_BIB6","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/174652.174660","article-title":"Optimal algorithms for parallel Givens factorization on a coarse grained PRAM","volume":"41","author":"Cosnard","year":"1994","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-8191(01)00087-4_BIB7","series-title":"Parallel Algorithms and Architectures","author":"Cosnard","year":"1995"},{"key":"10.1016\/S0167-8191(01)00087-4_BIB8","unstructured":"J.J. Dongarra, I.S. Duff, D.C. Sorensen, H.A. van der Vorst, Solving Linear Systems on Vector and Shared Memory Computers, SIAM, Philadelphia, 1991"},{"key":"10.1016\/S0167-8191(01)00087-4_BIB9","unstructured":"K.A. Gallivan, M.T. Heath, Esmond Ng, J.M. Ortega, B.W. Peyton, R.J. Plemmons, C.H. Romine, A.H. Sameh, R.G. Voigt, Parallel Algorithms for Matrix Computations, SIAM, Philadelphia, 1990"},{"key":"10.1016\/S0167-8191(01)00087-4_BIB10","unstructured":"G.H. Golub, C.F. Van Loan, Matrix Computations, third ed., The John Hopkins University Press, Baltimore, MD, 1996"},{"issue":"1","key":"10.1016\/S0167-8191(01)00087-4_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/322358.322366","article-title":"Solving linear algebraic equations on an MIMD computer","volume":"30","author":"Lord","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-8191(01)00087-4_BIB12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01389639","article-title":"An alternative Givens ordering","volume":"43","author":"Modi","year":"1984","journal-title":"Numer. Math."},{"issue":"6","key":"10.1016\/S0167-8191(01)00087-4_BIB13","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1137\/0910067","article-title":"Distributed orthogonal factorization: Givens and Householder algorithms","volume":"10","author":"Pothen","year":"1989","journal-title":"SIAM J. Scient. Stat. Comput."},{"issue":"1","key":"10.1016\/S0167-8191(01)00087-4_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/322047.322054","article-title":"On stable parallel linear system solvers","volume":"25","author":"Sameh","year":"1978","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101000874?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819101000874?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:51:16Z","timestamp":1556229076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819101000874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":14,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0167819101000874"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(01)00087-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}