{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:03:30Z","timestamp":1768028610566,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540616269","type":"print"},{"value":"9783540706335","type":"electronic"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61626-8_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:05:01Z","timestamp":1330293901000},"page":"165-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Optimal grain size computation for pipelined algorithms"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Desprez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Ramet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"T. Brandes and F. Desprez. Implementing Pipelined Computation and Communication in an HPF Compiler. Submitted to Europar'96, 1996.","DOI":"10.1007\/3-540-61626-8_62"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, and R.C. Whaley. LAPACK Working Note: ScaLA-PACK: A Portable Linear Algebra Library for Distributed Memory Computers \u2014 Design Issues and Performances. Technical Report 95, Department of Computer Science \u2014 University of Tennessee, 1995.","DOI":"10.1007\/3-540-60902-4_12"},{"key":"21_CR3","first-page":"365","volume-title":"A Library for Coarse Grain Macro-Pipelining in Distributed Memory Architectures","author":"F. Desprez","year":"1994","unstructured":"F. Desprez. A Library for Coarse Grain Macro-Pipelining in Distributed Memory Architectures. In IFIP 10.3 Conference on Programming Environments for Massively Parallel Distributed Systems, pages 365\u2013371. Birkhaeuser Verlag AG, Basel, Switzerland, 1994."},{"key":"21_CR4","unstructured":"F. Desprez. Proc\u00e9dures de Base pour le Calcul Scientifique sur Machines Parall\u00e8les \u00e0 M\u00e9moire Distribu\u00e9e. PhD thesis, Institut National Polytechnique de Grenoble, January 1994. LIP ENS-Lyon."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"F. Desprez, P. Ramet, and J. Roman. Optimal grain size computation for pipelined algorithms. Technical report, Laboratoire Bordelais de Recherche en Informatique, 1996.","DOI":"10.1007\/3-540-61626-8_21"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0167-739X(94)90029-9","volume":"10","author":"F. Desprez","year":"1994","unstructured":"F. Desprez and B. Tourancheau. LOCCS: Low Overhead Communication and Computation Subroutines. Future Generation Computer Systems, 10(2&3):279\u2013284, June 1994.","journal-title":"Future Generation Computer Systems"},{"key":"21_CR7","unstructured":"B. Tourancheau M. Pourzandi. Recouvrement Calcul\/Communication dans l'Elimination de Gauss sur un iPSC\/960. Technical report, Ecole Normal Sup\u00e9rieure de Lyon, 1992."},{"key":"21_CR8","first-page":"270","volume-title":"Optimal Tile Size Adjustement in Compiling General DOACROSS Loop Nests","author":"H. Ohta","year":"1995","unstructured":"H. Ohta, Y. Saito, M. Kainaga, and H. Ono. Optimal Tile Size Adjustement in Compiling General DOACROSS Loop Nests. In ACM Press, editor, International Conference on Supercomputing, pages 270\u2013279, Barcelona, Spain, July 1995. ACM SIGARCH."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0024-3795(86)90174-6","volume":"77","author":"Y. Saad","year":"1986","unstructured":"Y. Saad. Communication Complexity of the Gaussian Elimination Algorithm on Multiprocessors. Linear Algebra and Applications, 77:315\u2013340, 1986.","journal-title":"Linear Algebra and Applications"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"B.S. Siegel and P.A. Steenkiste. Controlling Application Grain Size on a Network of Workstations. In Supercomputing'95, 1995.","DOI":"10.1145\/224170.224497"},{"key":"21_CR11","unstructured":"C.W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Rice University, January 1993."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:23:09Z","timestamp":1587342189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}