{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T09:22:52Z","timestamp":1791105772973,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540576594","type":"print"},{"value":"9783540483083","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57659-2_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:14:16Z","timestamp":1330244056000},"page":"301-320","source":"Crossref","is-referenced-by-count":64,"title":["Maximizing loop parallelism and improving data locality via loop fusion and distribution"],"prefix":"10.1007","author":[{"given":"Ken","family":"Kennedy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kathryn S.","family":"McKinley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"18_CR1","volume-title":"PhD thesis","author":"W. Abu-Sufah","year":"1979","unstructured":"W. Abu-Sufah. Improving the Performance of Virtual Memory Computers. PhD thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1979."},{"key":"18_CR2","unstructured":"F. Allen and J. Cocke. A catalogue of optimizing transformations. In J. Rustin, editor, Design and Optimization of Compilers. Prentice-Hall, 1972."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"J. R. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In Proceedings of the Fourteenth Annual ACM Symposium on the Principles of Programming Languages, Munich, Germany, Jan. 1987.","DOI":"10.1145\/41625.41631"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/29873.29875","volume":"9","author":"J. R. Allen","year":"1987","unstructured":"J. R. Allen and K. Kennedy. Automatic translation of Fortran programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491\u2013542, Oct. 1987.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"5","key":"18_CR5","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/PGEC.1966.264565","volume":"15","author":"A. J. Bernstein","year":"1966","unstructured":"A. J. Bernstein. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers, 15(5):757\u2013763, Oct. 1966.","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"18_CR6","unstructured":"D. Callahan. A Global Approach to Detection of Parallelism. PhD thesis, Dept. of Computer Science, Rice University, Mar. 1987."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for sub-scripted variables. In Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementation, White Plains, NY, June 1990.","DOI":"10.1145\/93542.93553"},{"key":"18_CR8","unstructured":"S. Carr, K. Kennedy, K. S. McKinley, and C. Tseng. Compiler optimizations for improving data locality. Technical Report TR92-195, Dept. of Computer Science, Rice University, Nov. 1992."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"G. Cybenko, L. Kipp, L. Pointer, and D. Kuck. Supercomputer performance evaluation and the Perfect benchmarks. In Proceedings of the 1990 ACM International Conference on Supercomputing, Amsterdam, The Netherlands, June 1990.","DOI":"10.1145\/77726.255163"},{"key":"18_CR10","unstructured":"R. Cytron, J. Ferrante, and V. Sarkar. Experiences using control dependence in PTRAN. In D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing. The MIT Press, 1990."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiway cuts. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, May 1992.","DOI":"10.1145\/129712.129736"},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319\u2013349, July 1987.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR13","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"Ford, Jr., L. R. and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"G. Gao, R. Olsen, V. Sarkar, and R. Thekkath. Collective loop fusion for array contraction. In Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, New Haven, CT, Aug. 1992.","DOI":"10.1007\/3-540-57502-2_53"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"A. Goldberg and R. Paige. Stream processing. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 228\u2013234, Aug. 1984.","DOI":"10.1145\/800055.802021"},{"issue":"4","key":"18_CR16","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery, 35(4):921\u2013940, Oct. 1988.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"M. W. Hall, K. Kennedy, and K. S. McKinley. Interprocedural transformations for parallel code generation. In Proceedings of Supercomputing '91, Albuquerque, NM, Nov. 1991.","DOI":"10.1145\/125826.126055"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"K. Kennedy and K. S. McKinley. Loop distribution with arbitrary control flow. In Proceedings of Supercomputing '90, New York, NY, Nov. 1990.","DOI":"10.1109\/SUPERC.1990.130048"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"K. Kennedy and K. S. McKinley. Optimizing for parallelism and data locality. In Proceedings of the 199S ACM International Conference on Supercomputing, Washington, DC, July 1992.","DOI":"10.1145\/143369.143427"},{"key":"18_CR20","unstructured":"K. Kennedy and K. S. McKinley. Typed fusion with applications to parallel and sequential code generation. Technical Report TR93-208, Dept. of Computer Science, Rice University, Aug. 1993."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"K. Kennedy, K. S. McKinley, and C. Tseng. Analysis and transformation in an interactive parallel programming tool. Concurrency: Practice & Experience, to appear 1993.","DOI":"10.1002\/cpe.4330050705"},{"key":"18_CR22","unstructured":"K. S. McKinley. Automatic and Interactive Parallelization. PhD thesis, Dept. of Computer Science, Rice University, Apr. 1992."},{"key":"18_CR23","unstructured":"A. Porterfield. Software Methods for Improvement of Cache Performance. PhD thesis, Dept. of Computer Science, Rice University, May 1989."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"V. Sarkar and G. Gao. Optimization of array accesses by collective loop transformations. In Proceedings of the 1991 ACM International Conference on Supercomputing, Cologne, Germany, June 1991.","DOI":"10.1145\/109025.109077"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"J. Warren. A hierachical basis for reordering transformations. In Conference Record of the Eleventh Annual ACM Symposium on the Principles of Programming Languages, Salt Lake City, UT, Jan. 1984.","DOI":"10.1145\/800017.800539"},{"key":"18_CR26","first-page":"712","volume":"154","author":"M. Yannakakis","year":"1983","unstructured":"M. Yannakakis, P. C. Kanellakis, S. C. Cosmadakis, and C. H. Papadimitriou. Cutting and partitioning a graph after a fixed pattern. Automata, Languages, and Programming \u2014 Lecture Notes in Computer Science, 154:712\u2013722, 1983.","journal-title":"Automata, Languages, and Programming \u2014 Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57659-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:33Z","timestamp":1605629613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57659-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540576594","9783540483083"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57659-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}