{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:39:20Z","timestamp":1742395160361,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602477"},{"type":"electronic","value":"9783540447696"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1007\/bfb0020483","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:33:05Z","timestamp":1132734785000},"page":"429-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Automatic vectorization of communications for data-parallel programs"],"prefix":"10.1007","author":[{"given":"C\u00e9cile","family":"Germain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Delaplace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"35_CR1","unstructured":"R. Asenjo and al. Sparse Block and Cyclick data distribution for matrix computation. In High Performance Computing, Technology and Applications, Elsevier, 95."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"C. Ancourt and F. Irigoin. Scanning polyhedra with DO loops. In 3rd ACM Symp. on Principles and Practice of Parallel Programming, pages 39\u201350, 91.","DOI":"10.1145\/109626.109631"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"D. Callahan and K. Kennedy. Compiling programs for distributed memory architectures. Jal. Supercomputing, (2):151\u2013169, Oct. 88.","DOI":"10.1007\/BF00128175"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"F. Cappello and al. Balanced distributed memory parallel computers. In 22nd Int. Conf. on Parallel Processing, pages I.72\u2013I.76-, August 93.","DOI":"10.1109\/ICPP.1993.52"},{"key":"35_CR5","unstructured":"S. Chatterjee and al. Generating local addresses and communication sets for data-parallel programs. In Symp on Principles and Practice of Programming Languages 93. ACM, 93."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"C.Koelbel. Compile-time generation of regular communication patterns. In Supercomputing 91, pages 101\u2013110, 91.","DOI":"10.1145\/125826.125890"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"A. Feldmann, T.M. Stricker, and T.E. Warfel. Supporting sets of arbitrary connections on iWarp through communication context switches. In ACM, editor, 5th ACM Symp. on Algorithms and Architectures, pages 203\u2013212, 93.","DOI":"10.1145\/165231.165257"},{"key":"35_CR8","unstructured":"F.Irigoin and al. A linear algebra framework for static HPF code distribution. In 4th Int. Work. on Compilers for Parallel Computers, pages 117\u2013132, 93."},{"key":"35_CR9","unstructured":"M. Le Fur. Scanning parameterized polyhedron using Fourier-Motzkin elimination. Technical report, IRISA, Sept. 94. PI 858."},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"S.K.S. Gupta and al. On compiling array expressions for efficient execution on distributed-memory machines. In 1993 Int. Conf. on Parallel Processing, pages II-301\u2013II-305, 93.","DOI":"10.1109\/ICPP.1993.122"},{"key":"35_CR11","unstructured":"D.E. Maydan, S.P. Amarasinghe, and M.S. Lam. Data dependence and data-flow analysis of arrays. In 5th Work on Languages and Compilers for Parallel Computing, pages 283\u2013292, 92."},{"key":"35_CR12","unstructured":"W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Comm. ACM, (8):102\u2013114, Aug. 92."},{"key":"35_CR13","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. Wiley, 86."},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"J.M. Stichnoth, D. O'Hallaron and T.R. Gross. Generating Communications for Array Statements; Design, Implementation and Evaluation. Jal. Parallele and Distributed computing, (21) 150\u2013159, Apr. 94.","DOI":"10.1006\/jpdc.1994.1048"},{"key":"35_CR15","unstructured":"C-W. Tseng. An optimizing Fortran D compiler for MIMD Distributed-memory machines. PhD thesis, Rice University, 93."}],"container-title":["Lecture Notes in Computer Science","EURO-PAR '95 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T21:46:40Z","timestamp":1736113600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602477","9783540447696"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0020483","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"9 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"}]}}