{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:57:58Z","timestamp":1764687478422,"version":"3.38.0"},"reference-count":13,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2001,8]]},"abstract":"<jats:p> In this paper, the authors deal with algorithmic issues on heterogeneous platforms. They concentrate on dense linear algebra kernels, such as matrix multiplication or LU decomposition. Block-cyclic distribution techniques used in ScaLAPACK are no longer sufficient to balance the load among processors running at different speeds. The main result of this paper is to provide a static data distribution scheme that leads to an asymptotically perfect load balancing for LU decomposition, thereby providing solid foundations toward the design of a cluster-oriented version of ScaLAPACK. <\/jats:p>","DOI":"10.1177\/109434200101500308","type":"journal-article","created":{"date-parts":[[2005,3,8]],"date-time":"2005-03-08T19:22:36Z","timestamp":1110309756000},"page":"310-323","source":"Crossref","is-referenced-by-count":12,"title":["Static LU Decomposition on Heterogeneous Platforms"],"prefix":"10.1177","volume":"15","author":[{"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[{"name":"LIP, UMR CNRS\u2014ENS Lyon\u2014INRIA 5668, Ecole Normale\r                        Sup\u00e9rieure de Lyon, France"}]},{"given":"Arnaud","family":"Legrand","sequence":"additional","affiliation":[{"name":"LIP, UMR CNRS\u2014ENS Lyon\u2014INRIA 5668, Ecole Normale\r                        Sup\u00e9rieure de Lyon, France"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"LIP, UMR CNRS\u2014ENS Lyon\u2014INRIA 5668, Ecole Normale\r                        Sup\u00e9rieure de Lyon, France"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[{"name":"LIP, UMR CNRS\u2014ENS Lyon\u2014INRIA 5668, Ecole Normale\r                        Sup\u00e9rieure de Lyon, France"}]}],"member":"179","published-online":{"date-parts":[[2001,8,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.386.0673"},{"volume-title":"Heterogeneity considered harmful to algorithm designers","year":"2000","author":"Beaumont, O.","key":"atypb2"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2000.876144"},{"volume-title":"Partitioning a square into rectangles: NP-completeness and approximation algorithms","year":"2000","author":"Beaumont, O.","key":"atypb4"},{"key":"atypb5","first-page":"279","volume-title":"The Grid: Blueprint for a New Computing Infrastructure","author":"Berman, F.","year":"1998"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719642"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000207"},{"first-page":"42","volume-title":"2nd International Symposium on High Performance Distributed Computing","author":"Crandall, P. E.","key":"atypb8"},{"volume-title":"The Grid: Blueprint for a New Computing Infrastructure","year":"1998","author":"Foster, I.","key":"atypb9"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(87)90060-3"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0092"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0100580"},{"volume-title":"Introduction to parallel computing","year":"1994","author":"Kumar, V.","key":"atypb13"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434200101500308","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434200101500308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T12:37:11Z","timestamp":1741091831000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/109434200101500308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["10.1177\/109434200101500308"],"URL":"https:\/\/doi.org\/10.1177\/109434200101500308","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}