{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T12:15:46Z","timestamp":1673093746176},"reference-count":44,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1016\/s0167-8191(99)00063-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T08:06:40Z","timestamp":1051258000000},"page":"1489-1510","source":"Crossref","is-referenced-by-count":4,"title":["Termination detection in parallel loop nests with while loops"],"prefix":"10.1016","volume":"25","author":[{"given":"Max","family":"Geigl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Griebl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(99)00063-0_BIB1","series-title":"Compilers \u2013 Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB2","unstructured":"C. Ancourt, F. Coelho, B. Creusillet, F. Irigoin, P. Jouvelot, 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. http:\/\/www.cri.ensmp.fr\/\u223cpips"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB3","doi-asserted-by":"crossref","unstructured":"C. Ancourt, F. Irigoin, Scanning polyhedra with DO loops, in: Proceedings of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'91), ACM, New York, 1991","DOI":"10.1145\/109625.109631"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB4","doi-asserted-by":"crossref","unstructured":"U. Banerjee, Loop transformations for restructuring compilers: the foundations, Series on Loop Transformations for Restructuring Compilers, Kluwer Academic Publishers, Dordrecht, 1993","DOI":"10.1007\/b102311"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB5","doi-asserted-by":"crossref","unstructured":"U. Banerjee, Loop parallelization, Series on Loop Transformations for Restructuring Compilers, Kluwer Academic Publishers, Dordrecht, 1994","DOI":"10.1007\/b102311"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB6","doi-asserted-by":"crossref","unstructured":"W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger, D. Padua, P. Petersen, W. Pottenger, L. Rauchwerger, P. Tu, S. Weatherford, Polaris: improving the effectiveness of parallelizing compilers, in: K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.), Proceedings of the Seventh International Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science 892, Springer, Berlin, 1995, pp. 141\u2013154","DOI":"10.1007\/BFb0025876"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-8191(89)90028-8","article-title":"Pipelined iterative methods for shared-memory machines","volume":"11","author":"Bonomo","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-9260(94)90019-1","article-title":"(Pen)-ultimate tiling?","volume":"17","author":"Boulet","year":"1994","journal-title":"Integration"},{"issue":"2","key":"10.1016\/S0167-8191(99)00063-0_BIB9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02577789","article-title":"Automatic parallelization of while-loops using speculative execution","volume":"23","author":"Collard","year":"1995","journal-title":"Int. J. Parallel Programming"},{"issue":"4","key":"10.1016\/S0167-8191(99)00063-0_BIB10","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1142\/S0129626495000497","article-title":"Revisiting the decomposition of Karp, Miller, and Winograd","volume":"5","author":"Darte","year":"1995","journal-title":"Parallel Process. Lett."},{"issue":"6","key":"10.1016\/S0167-8191(99)00063-0_BIB11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1023\/A:1025168022993","article-title":"Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs","volume":"25","author":"Darte","year":"1997","journal-title":"Int. J. Parallel Programming"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB12","doi-asserted-by":"crossref","unstructured":"M. Dion, Y. Robert, Mapping affine loop nests: new results, in: B. Hertzberger, G. Serazzi (Eds.), High-Performance Computing and Networking (HPCN'95), Lecture Notes in Computer Science, vol. 919, Springer, Berlin, 1995, pp. 184\u2013189","DOI":"10.1007\/BFb0046628"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB13","unstructured":"P. Faber, Transformation von shared-memory-programmen zu distributed-memory-programmen, Diploma Thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, November 1997. http:\/\/www.fmi.uni-passau.de\/loopo\/doc\/faber-d.ps.gz"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB14","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Array expansion, in: Proceedings of the International Conference on Supercomputing (ICS'88), ACM, New York, 1988, pp. 429\u2013441","DOI":"10.1145\/55364.55406"},{"issue":"1","key":"10.1016\/S0167-8191(99)00063-0_BIB15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","article-title":"Dataflow analysis of array and scalar references","volume":"20","author":"Feautrier","year":"1991","journal-title":"Int. J. Parallel Programming"},{"issue":"5","key":"10.1016\/S0167-8191(99)00063-0_BIB16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01407835","article-title":"Some efficient solutions to the affine scheduling problem. Part I. one-dimensional time","volume":"21","author":"Feautrier","year":"1992","journal-title":"Int. J. Parallel Programming"},{"issue":"6","key":"10.1016\/S0167-8191(99)00063-0_BIB17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01379404","article-title":"Some efficient solutions to the affine scheduling problem. Part II. multidimensional time","volume":"21","author":"Feautrier","year":"1992","journal-title":"Int. J. Parallel Programming"},{"issue":"3","key":"10.1016\/S0167-8191(99)00063-0_BIB18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1142\/S0129626494000235","article-title":"Toward automatic distribution","volume":"4","author":"Feautrier","year":"1994","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0167-8191(99)00063-0_BIB19","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Automatic parallelization in the polytope model, in: G.-R. Perrin, A. Darte (Eds.), The Data Parallel Programming Model, Lecture Notes in Computer Science, vol. 1132, Springer, Berlin, 1996, pp. 79\u2013103","DOI":"10.1007\/3-540-61736-1_44"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB20","unstructured":"M. Geigl, Parallelization of loop nests with general bounds in the polyhedron model, Diploma Thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, March 1997. http:\/\/www.fmi.uni-passau.de\/loopo\/doc\/geigl-d.ps.gz"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB21","unstructured":"M. Griebl, The mechanical parallelization of loop nests containing while loops, Ph.D. Thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Technical Report MIP-9701, 1996"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB22","doi-asserted-by":"crossref","unstructured":"M. Griebl, J.-F. Collard, Generation of synchronous code for automatic parallelization of while loops, in: S. Haridi, K. Ali, P. Magnusson (Eds.), EURO-PAR'95, Lecture Notes in Computer Science 966, Springer, Berlin, 1995, pp. 315\u2013326","DOI":"10.1007\/BFb0020474"},{"issue":"3","key":"10.1016\/S0167-8191(99)00063-0_BIB23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0129626494000223","article-title":"On the space\u2013time mapping of WHILE-loops","volume":"4","author":"Griebl","year":"1994","journal-title":"Parallel Process. Lett."},{"issue":"5","key":"10.1016\/S0167-8191(99)00063-0_BIB24","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF02577774","article-title":"A communication scheme for the distributed execution of loop nests with while loops","volume":"23","author":"Griebl","year":"1995","journal-title":"Int. J. Parallel Programming"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB25","doi-asserted-by":"crossref","unstructured":"M. Griebl, C. Lengauer, Classifying loops for space\u2013time mapping, in: L. Boug\u00e9, P. Fraigniaud, A. Mignotte, Y. Robert (Eds.), Euro-Par'96, vol. I, Lecture Notes in Computer Science, vol. 1123, Springer, Berlin, 1996, pp. 467\u2013474","DOI":"10.1007\/3-540-61626-8_64"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB26","doi-asserted-by":"crossref","unstructured":"M. Griebl, C. Lengauer, The loop parallelizer LooPo \u2013 Announcement, in: D. Sehr, U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.), Languages and Compilers for Parallel Computing (LCPC'96), Lecture Notes in Computer Science, vol. 1239, Springer, Berlin, 1997, pp. 603\u2013604. http:\/\/www.fmi.uni-passau.de\/loopo\/","DOI":"10.1007\/BFb0017283"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB27","doi-asserted-by":"crossref","unstructured":"M. Griebl, C. Lengauer, S. Wetzel, Code generation in the polytope model, in: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT'98), IEEE Computer Soc. Press, Silver Spring, MD, 1998, pp. 603\u2013604","DOI":"10.1109\/PACT.1998.727179"},{"issue":"2","key":"10.1016\/S0167-8191(99)00063-0_BIB28","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","article-title":"The parallel execution of DO loops","volume":"17","author":"Lamport","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB29","doi-asserted-by":"crossref","unstructured":"C. Lengauer, Loop parallelization in the polytope model, in: E. Best (Ed.), CONCUR'93, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, 1993, pp. 398\u2013416","DOI":"10.1007\/3-540-57208-2_28"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB30","doi-asserted-by":"crossref","unstructured":"C. Lengauer, M. Griebl, On the parallelization of loop nests containing while loops, in: N. Mirenkov, Q.-P. Gu, S. Peng, S. Sedukhin (Eds.), Proceedings of the First Aizu International Symposium on Parallel Algorithm\/Architecture Synthesis (pAs'95), IEEE Computer Soc. Press, Silver Spring, MD, 1995, pp. 10\u201318","DOI":"10.1109\/AISPAS.1995.401360"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB31","series-title":"Parallel Programming with MPI","author":"Pacheco","year":"1997"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB32","unstructured":"Parsytec, PARIX 1.2 Reference Manual, March 1993"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB33","unstructured":"C. Polychronopoulos, M.B. Girkar, M.R. Haghighat, C.L. Lee, B.P. Leung, D.A. Schouten, The structure of Parafrase-2: an advanced parallelizing compiler for C and Fortran, in: D. Gelernter, A. Nicolau, D. Padua (Eds.), Languages and Compilers for Parallel Computing (LCPC'90), Research Monographs in Parallel and Distributed Computing, Pitman, London, 1990, pp. 423\u2013453"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB34","unstructured":"PRiSM SCPDP Team, Systematic construction of parallel and distributed programs. http:\/\/www.prism.uvsq.fr\/english\/parallel\/paf\/autom_us.html"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB35","doi-asserted-by":"crossref","unstructured":"L. Rauchwerger, D. Padua, Parallelizing while loops for multiprocessor systems, in: Proceedings of the ninth International Parallel Programming Symposium (IPPS'95), IEEE Computer Soc. Press, Silver Spring, MD, 1995, pp. 347\u2013355","DOI":"10.1109\/IPPS.1995.395955"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB36","unstructured":"M. Schumergruber, Partitionierung von parallelen Schleifens\u00e4tzen, Diploma Thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, September 1997. http:\/\/www.fmi.uni-passau.de\/loopo\/doc\/schumergruber-d.ps.gz"},{"issue":"3","key":"10.1016\/S0167-8191(99)00063-0_BIB37","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0167-9260(93)90013-3","article-title":"Partitioning of processor arrays: a piecewise regular approach","volume":"14","author":"Teich","year":"1993","journal-title":"Integration"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB38","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00127840","article-title":"Parallelization of while loops on pipelined architectures","volume":"5","author":"Tirumalai","year":"1991","journal-title":"J. Supercomputing"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB39","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/jsco.1997.0122","article-title":"Simulation and optimization by quantifier elimination","volume":"24","author":"Weispfenning","year":"1997","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0167-8191(99)00063-0_BIB40","doi-asserted-by":"crossref","unstructured":"R.P. Wilson, R.S. French, C.S. Wilson, S.P. Amarasinghe, J.M. Anderson, S.W.K. Tjiang, S.-W. Liao, C.-W. Tseng, M.W. Hall, M.S. Lam, J.L. Hennessy, SUIF: an infrastructure for research on parallelizing and optimizing compilers, in: Proceedings of the Fourth ACM SIGPLAN Symposoum on Principles and Practice of Parallel Programming (PPoPP), ACM, New york, 1994. http:\/\/suif.stanford.edu\/suif\/","DOI":"10.1145\/193209.193217"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB41","unstructured":"M. Wolfe, Optimizing supercompilers for supercomputers, in: Research Monographs in Parallel and Distributed Computing, MIT Press, Cambridge, MA, 1989"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB42","series-title":"High Performance Compilers for Parallel Computing","author":"Wolfe","year":"1995"},{"key":"10.1016\/S0167-8191(99)00063-0_BIB43","unstructured":"Y. Wu, T.G. Lewis, Parallelizing while loops, in: D.A. Padua (Ed.), Proceedings of the International Conference on Parallel Processing (ICPP'90), vol. II: Software, Pennsylvania State University Press, 1990, pp. 1\u20138"},{"issue":"1","key":"10.1016\/S0167-8191(99)00063-0_BIB44","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1006\/jpdc.1997.1310","article-title":"Communication-minimal tiling of uniform dependence loops","volume":"42","author":"Xue","year":"1997","journal-title":"J. Parallel Distributed Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000630?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000630?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T06:44:54Z","timestamp":1580366694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":44,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0167819199000630"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00063-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}