{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:57Z","timestamp":1755220977241,"version":"3.43.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1023\/a:1007904422322","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T07:13:40Z","timestamp":1040541220000},"page":"333-353","source":"Crossref","is-referenced-by-count":3,"title":["The Static Parallelization of Loops and Recursions"],"prefix":"10.1007","volume":"11","author":[{"given":"Christian","family":"Lengauer","sequence":"first","affiliation":[]},{"given":"Sergei","family":"Gorlatch","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Herrmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"147009_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Series in Computer Science and Information Processing. Addison-Wesley, Reading, MA, 1974."},{"key":"147009_CR2","series-title":"Technical Report","volume-title":"PIPS: A framework for building interprocedural compilers, parallelizers and optimizers","author":"C. Ancourt","year":"1996","unstructured":"C. Ancourt, F. Coelho, B. Creusillet, F. Irigoin, P. Jouvelot, and R. Keryell. PIPS: A framework for building interprocedural compilers, parallelizers and optimizers. Technical Report A\/289. Centre de Recherche en Informatique, Ecole des Mines de Paris, April, 1996. WWW: http:\/\/www.cri.ensmp.fr\/~pips\/."},{"key":"147009_CR3","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/ASAP.1993.397164","volume-title":"Proc. Int. Conf. Application Specific Array Processors (ASAP'93)","author":"D.G. Baltus","year":"1993","unstructured":"D.G. Baltus and J. Allen. Efficient exploration of nonuniform space-time transformations for optimal systolic array synthesis. In L. Dadda and B. Wah, eds, Proc. Int. Conf. Application Specific Array Processors (ASAP'93), pp. 428\u2013441. IEEE Computer Society Press. Los Alamitos, CA, 1993."},{"key":"147009_CR4","doi-asserted-by":"crossref","unstructured":"U. Banerjee. Loop Transformations for Restructuring Compilers: The Foundations. Series on Loop Transformations for Restructuring Compilers, Kluwer Academic Publishers, 1993.","DOI":"10.1007\/b102311"},{"key":"147009_CR5","doi-asserted-by":"crossref","unstructured":"U. Banerjee. Loop Parallelization. Series on Loop Transformations for Restructuring Compilers, Kluwer Academic Publishers, 1994.","DOI":"10.1007\/978-1-4757-5676-0"},{"key":"147009_CR6","unstructured":"U. Banerjee. Dependence Analysis. Series on Loop Transformations for Restructuring Compilers, Kluwer Academic Publishers, 1997."},{"key":"147009_CR7","doi-asserted-by":"crossref","unstructured":"R.S. Bird. Lectures on constructive functional programming. In M. Broy, ed., Constructive Methods in Computing Science, NATO ASI Series F: Computer and Systems Sciences, Vol. 55, pp. 151\u2013216, Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-74884-4_5"},{"key":"147009_CR8","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","volume":"38","author":"G. Blelloch","year":"1989","unstructured":"G. Blelloch. Scans as primitive parallel operations. IEEE Trans. on Computers, 38:1526\u20131538, 1989.","journal-title":"IEEE Trans. on Computers"},{"key":"147009_CR9","unstructured":"P. Boulet, M. Dijon, E. Lequiniou, and T. Risset. Reference manual of the Bouclettes parallelizer. Technical Report 94-04, Laboratoire de l'Informatique du Parall\u00e9lisme. Ecole Normale Sup\u00e9rieure de Lyon, 1994. WWW: http:\/\/www.prism.uvsq.fr\/public\/bop\/base\/bclt\/ bouclettes.html."},{"key":"147009_CR10","unstructured":"M.I. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation, Research Monographs in Parallel and Distributed Computing, Pitman, 1989."},{"key":"147009_CR11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1142\/S0129626495000175","volume":"5","author":"M.I. Cole","year":"1995","unstructured":"M.I. Cole. Parallel programming with list homomorphisms. Parallel Processing Letters, 5:191\u2013204, 1995.","journal-title":"Parallel Processing Letters"},{"key":"147009_CR12","unstructured":"M.I. Cole, S. Gorlatch, C. Lengauer, and D.B. Skillicorn, eds. Theory and practice of higher-order parallel programming. Technical Report 169. Schlo\u03b2 Dagstuhl, 1997."},{"key":"147009_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02577789","volume":"23","author":"J.-F. Collard","year":"1995","unstructured":"J.-F. Collard. Automatic parallelization of while-loops using speculative execution. Int. J. Parallel Programming, 23:191\u2013219, 1995.","journal-title":"Int. J. Parallel Programming"},{"key":"147009_CR14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0167-9260(91)90026-H","volume":"12","author":"A. Darte","year":"1991","unstructured":"A. Darte. Regular partitioning for synthesizing fixed-size systolic arrays. INTEGRATION, 12:293\u2013304, 1991.","journal-title":"INTEGRATION"},{"key":"147009_CR15","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science, Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4612-3228-5"},{"key":"147009_CR16","doi-asserted-by":"crossref","unstructured":"P. Feautrier. Array expansion. In Proc. Int. Conf. on Supercomputing, pp. 429\u2013441, ACM Press, 1988.","DOI":"10.1145\/55364.55406"},{"key":"147009_CR17","doi-asserted-by":"crossref","unstructured":"P. Feautrier. Automatic parallelization in the polytope model. In G.-R. Perrin and A. Darte, eds., The Data Parallel Programming Model. Lecture Notes in Computer Science 1132, pp. 79\u2013103, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61736-1_44"},{"key":"147009_CR18","doi-asserted-by":"crossref","unstructured":"J. Gibbons. Upwards and downwards accumulations on trees. In R. Bird, C. Morgan, and J. Woodcock, eds., Mathematics of Program Construction, Lecture Notes in Computer Science 669, pp. 122\u2013138, Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56625-2_11"},{"key":"147009_CR19","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/0165-6074(96)00004-X","volume":"41","author":"S. Gorlatch","year":"1996","unstructured":"S. Gorlatch. From transformations to methodology in parallel program development: a case study. Microprocessing and Microprogramming, 41:571\u2013588, 1996.","journal-title":"Microprocessing and Microprogramming"},{"key":"147009_CR20","doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In L. Boug\u00e9, P. Fraigniaud, A. Mignotte, and Y. Robert, eds., Euro-Par'96, Lecture Notes in Computer Science 1124, pp. 401\u2013408, Springer-Verlag, 1996.","DOI":"10.1007\/BFb0024729"},{"key":"147009_CR21","doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Systematic extraction and implementation of divide-and-conquer parallelism. In H. Kuchen and D. Swierstra, eds., Programming Languages: Implementation, Logics and Programs, Lecture Notes in Computer Science 1140, pp. 274\u2013288, Springer-Verlag, 1996c.","DOI":"10.1007\/3-540-61756-6_91"},{"key":"147009_CR22","unstructured":"S. Gorlatch and H. Bischof. Formal derivation of divide-and-conquer programs: A case study in the multidimensional FFT's. In D. Mery, ed., Proc. 2nd Int. Workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA'97), pp. 80\u201394, IEEE Computer Society, 1997."},{"key":"147009_CR23","unstructured":"M. Griebl. The Mechanical Parallelization of Loop Nests Containing while Loops. PhD thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau. Technical Report MIP-9701, 1996."},{"key":"147009_CR24","doi-asserted-by":"crossref","unstructured":"M. Griebl and C. Lengauer. Classifying loops for space-time mapping. In L. Boug\u00e9, P. Fraigniaud, A. Mignotte, and Y. Robert, eds., Euro-Par'96, Vol. I, Lecture Notes in Computer Science 1123, pp. 467\u2013474, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61626-8_64"},{"key":"147009_CR25","unstructured":"M. Griebl and C. Lengauer. The loop parallelizer LooPo. In M. Gerndt, ed., Proc. Sixth Workshop on Compilers for Parallel Computers, volume 21 of Konferenzen des Forschungszentrums J\u00fclich, pp. 311\u2013320, Forschungszentrum J\u00fclich, 1996. WWW: http:\/\/www.uni-passau.de\/~loopo\/."},{"key":"147009_CR26","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1142\/S0129626496000479","volume":"6","author":"C.A. Herrmann","year":"1996","unstructured":"C.A. Herrmann and C. Lengauer. On the space-time mapping of a class of divide-and-conquer recursions. Parallel Processing Letters, 6:525\u2013537, 1996.","journal-title":"Parallel Processing Letters"},{"key":"147009_CR27","doi-asserted-by":"crossref","unstructured":"C.A. Herrmann and C. Lengauer. Transformation of divide -- conquer to nested parallel loops. In H. Glaser, P. Hartel, and H. Kuchen, eds., Programming Languages: Implementation, Logics, and Programs (PLILP'97), Lecture Notes in Computer Science 1292, pp. 95\u2013109, Springer-Verlag, 1997.","DOI":"10.1007\/BFb0033839"},{"key":"147009_CR28","unstructured":"V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin\/Cummings, 1994."},{"key":"147009_CR29","unstructured":"C. Lengauer. Aview of systolic design. In N.N. Mirenkov, ed., Parallel Computing Technologies (PaCT-91), pp. 32\u201346, World Scientific, 1991."},{"key":"147009_CR30","doi-asserted-by":"crossref","unstructured":"C. Lengauer. Loop parallelization in the polytope model. In E. Best, ed., CONCUR'93, Lecture Notes in Computer Science 715, pp. 398\u2013416, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_28"},{"key":"147009_CR31","doi-asserted-by":"crossref","unstructured":"C. Lengauer and M. Griebl. On the parallelization of loop nests containing while loops. In N.N. Mirenkov, Q.-P. Gu, S. Peng, and S. Sedukhin, eds., Proc. 1st Aizu Int. Symp. on Parallel Algorithm\/Architecture Synthesis (pAs'95), pp. 10\u201318, IEEE Computer Society Press, 1995.","DOI":"10.1109\/AISPAS.1995.401360"},{"key":"147009_CR32","unstructured":"C. Lengauer, L. Thiele, M. Wolfe, and H. Zima, eds. Loop parallelization. Technical Report 142, Schlo\u03b2 Dagstuhl, 1996."},{"key":"147009_CR33","doi-asserted-by":"crossref","unstructured":"V. Loechner and C. Mongenet. OPERA:Atoolbox for loop parallelization. In I. Jelly, I. Gorton, and P. Croll, eds., Proc. 1st Int. Workshop on Software Engineering for Parallel and Distributed Systems, pp. 134\u2013145. Chapman -- Hall, 1996. WWW: http:\/\/icps.u-strasbg.fr\/opera\/.","DOI":"10.1007\/978-0-387-34984-8_12"},{"key":"147009_CR34","unstructured":"R. Miller. A Constructive Theory of Multidimensional Arrays. PhD thesis, Programming Research Group, Oxford University, 1993."},{"key":"147009_CR35","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF00129780","volume":"2","author":"Z.G. Mou","year":"1988","unstructured":"Z.G. Mou and P. Hudak. An algebraic model for divide-and-conquer algorithms and its parallelism. Journal of Supercomputing, 2:257\u2013278, 1988.","journal-title":"Journal of Supercomputing"},{"key":"147009_CR36","unstructured":"M.J. Quinn. Parallel Computing, McGraw-Hill, 1994."},{"key":"147009_CR37","unstructured":"P. Quinton and Y. Robert. Systolic Algorithms and Architectures, Prentice-Hall, 1990."},{"key":"147009_CR38","unstructured":"R. Sedgewick. Algorithms, Addison-Wesley, 1988."},{"key":"147009_CR39","doi-asserted-by":"crossref","unstructured":"D.B. Skillicorn. Foundations of Parallel Programming, Cambridge International Series on Parallel Computation, Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511526626"},{"key":"147009_CR40","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-6423(87)90034-7","volume":"8","author":"D. Smith","year":"1987","unstructured":"D. Smith. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, 8:213\u2013229, 1987.","journal-title":"Science of Computer Programming"},{"key":"147009_CR41","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00927836","volume":"3","author":"J. Teich","year":"1991","unstructured":"J. Teich and L. Thiele. Control generation in the design of processor arrays. J. VLSI Signal Processing, 3:77\u201392, 1991.","journal-title":"J. VLSI Signal Processing"},{"key":"147009_CR42","unstructured":"S. Thompson. Haskell --The Craft of Functional Programming, International Computer Science Series, Addison-Wesley, 1996."},{"key":"147009_CR43","doi-asserted-by":"crossref","unstructured":"C. Wedler and C. Lengauer. Parallel implementations of combinations of broadcast, reduction and scan. In Proc. 2nd Int. Workshop on Software Engineering for Parallel and Distributed Systems (PDSE'97), pp. 108\u2013119, IEEE Computer Society Press, 1997.","DOI":"10.1109\/PDSE.1997.596831"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007904422322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007904422322\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007904422322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:29:35Z","timestamp":1754630975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007904422322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["147009"],"URL":"https:\/\/doi.org\/10.1023\/a:1007904422322","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}