{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:21Z","timestamp":1725664161542},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540579816"},{"type":"electronic","value":"9783540484080"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57981-8_159","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:05:31Z","timestamp":1330268731000},"page":"447-456","source":"Crossref","is-referenced-by-count":3,"title":["Parallelizing compilers: what can be achieved?"],"prefix":"10.1007","author":[{"given":"Mich\u00e8le","family":"Dion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Laurent","family":"Philippe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"issue":"6","key":"74_CR1","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/173262.155101","volume":"28","author":"Jennifer M. M. Anderson","year":"1993","unstructured":"Jennifer M. Anderson and Monica S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. ACM Sigplan Notices, 28(6):112\u2013125, June 1993.","journal-title":"ACM Sigplan Notices"},{"key":"74_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00128174","volume":"2","author":"U. Banerjee","year":"1988","unstructured":"Utpal Banerjee. An introduction to a formal theory of dependence analysis. The Journal of Supercomputing, 2:133\u2013149, 1988.","journal-title":"The Journal of Supercomputing"},{"key":"74_CR3","unstructured":"Thomas Brandes. Adaptor language reference manuel \u2014 version 1.0. Technical report, German National Institute for Computer Science, 1993."},{"key":"74_CR4","unstructured":"Thomas Brandes. Adaptor the distributed array library \u2014 version 1.0. Technical report, German National Research Institute for Computer Science, 1993."},{"key":"74_CR5","unstructured":"Thomas Brandes. Adaptor users guide. Technical report, German National Research Institute for Computer Science, 1993."},{"key":"74_CR6","unstructured":"Alain Darte, Tanguy Risset, and Yves Robert. Loop nest scheduling and transformations. In J.J. Dongarra and B. Tourancheau, editors, Environments and Tools for Parallel Scientific Computing, volume 6 of Advances in Parallel Computing, pages 309\u2013332. North Holland, 1993."},{"key":"74_CR7","unstructured":"Alain Darte and Yves Robert. A graph-theoretic approach to the alignment problem. Technical Report 93-20, Laboratoire de l'Informatique du Parall\u00e9lisme, Ecole Normale Sup\u00e9rieure de Lyon, July 1993. To appear in Parallel Processing Letters."},{"key":"74_CR8","unstructured":"Alain Darte and Yves Robert. Mapping uniform loop nests onto distributed memory architectures. Technical Report 93-03, Laboratoire de l'Informatique du Parall\u00e9lisme, Ecole Normale Sup\u00e9rieure de Lyon, January 1993. To appear in Parallel Computing."},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"Mich\u00e8le Dion, Jean-Laurent Philippe, and Yves Robert. Parallelizing compilers: what can be achieved ? Technical report, Laboratoire de l'Informatique du Parall\u00e9lisme, Ecole Normale Sup\u00e9rieure de Lyon, February 1994.","DOI":"10.1007\/3-540-57981-8_159"},{"issue":"1","key":"74_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Paul Feautrier. Dataflow analysis of array and scalar references. Int. J. Parallel Programming, 20(1):23\u201351, 1991.","journal-title":"Int. J. Parallel Programming"},{"key":"74_CR11","volume-title":"Technical Report 92-28","author":"P. Feautrier","year":"1992","unstructured":"Paul Feautrier. Some efficient solutions to the affine scheduling problem, part i, onedimensional time. Technical Report 92-28, Laboratoire MASI, Universit\u00e9 Pierre et Marie Curie, Paris, May 1992. to appear in Int. J. Parallel Programming."},{"key":"74_CR12","doi-asserted-by":"crossref","unstructured":"Seema Hiranandani, Ken Kennedy, and Chau-Wen Tseng. Compiler optimizations for FORTRAN D on MIMD distributed-memory machines. In Supercomputing 91, pages 86\u2013100. IEEE Computer Society Press, nov 1991.","DOI":"10.1145\/125826.125886"},{"key":"74_CR13","doi-asserted-by":"crossref","unstructured":"C.H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. In Banerjee, Gelernter, Nicolau, and Padua, editors, Languages and Compilers for Parallel Computing, volume 589 of Lecture Notes in Computer Science, pages 186\u2013200. Springer Verlag, 1991.","DOI":"10.1007\/BFb0038665"},{"key":"74_CR14","doi-asserted-by":"crossref","unstructured":"Charles H. Koelbel, David B. Loveman, Robert S. Schreiber, Guy L. Steele Jr., and Mary E. Zosel. The High Performance Fortran Handbook. The MIT Press, 1994.","DOI":"10.1063\/1.4823319"},{"issue":"2","key":"74_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Leslie Lamport. The parallel execution of do loops. Communications of the ACM, 17(2):83\u201393, feb 1974.","journal-title":"Communications of the ACM"},{"key":"74_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0743-7315(91)90090-V","volume":"13","author":"J. Li","year":"1991","unstructured":"Jingke Li and Marina Chen. The data alignment phase in compiling programs for distributed memory machines. Journal Parallel Distributed Computing, 13:213\u2013221, 1991.","journal-title":"Journal Parallel Distributed Computing"},{"issue":"8","key":"74_CR17","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/12.30873","volume":"38","author":"J. K. Peir","year":"1989","unstructured":"J.K. Peir and R. Cytron. Minimum distance: a method for partitioning recurrences for multiprocessors. IEEE Transactions on Computers, 38(8):1203\u20131211, aug 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"74_CR18","unstructured":"Chau-Wen Tseng. An optimizing fortran D compiler for MIMD distributed-memory machines. Technical report, Rice University, 1993."}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57981-8_159.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:07Z","timestamp":1605647767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57981-8_159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540579816","9783540484080"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57981-8_159","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}