{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:26:00Z","timestamp":1770283560234,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1023\/a:1007516818651","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:04:10Z","timestamp":1040551450000},"page":"607-631","source":"Crossref","is-referenced-by-count":39,"title":["Index Set Splitting"],"prefix":"10.1007","volume":"28","author":[{"given":"Martin","family":"Griebl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Feautrier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"227351_CR1","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Automatic parallelization in the polytope model, The Data Parallel Programming Model, G.-R. Perrin and A. Darte (eds.), Springer-Verlag, Lecture Notes in Computer Science, Vol. 1132, pp. 79\u2013103 (1996).","DOI":"10.1007\/3-540-61736-1_44"},{"key":"227351_CR2","doi-asserted-by":"crossref","unstructured":"C. Lengauer, Loop parallelization in the polytope model, CONCUR'93, E. Best (ed.), Springer-Verlag, Lecture Notes in Computer Science, Vol. 715, pp. 398\u2013416 (1993).","DOI":"10.1007\/3-540-57208-2_28"},{"issue":"2","key":"227351_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S0129626491000021","volume":"1","author":"A. Darte","year":"1991","unstructured":"A. Darte, L. Khachiyan, and Y. Robert, Linear scheduling is nearly optimal, Parallel Processing Letters 1(2):73\u201381 (December 1991).","journal-title":"Parallel Processing Letters"},{"key":"227351_CR4","unstructured":"P. Quinton, The systematic design of systolic arrays, Automata Networks in Computer Science, F. F. Souli\u00e9, Y. Robert, and M. Tchuent\u00e9 (eds.), Chap. 9, Manchester University Press, pp. 229\u2013260 (1987). [Also: Technical Reports 193 and 216, IRISA (INRIA-Rennes), 1983]."},{"key":"227351_CR5","doi-asserted-by":"crossref","unstructured":"A. Darte and F. Vivien, On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops, Euro-Par'96: Parallel Processing, Vol. I, L. Bouge, P. Fraigniaud, A. Mignotte, and Y. Robert (eds.), Springer-Verlag, Lecture Notes in Computer Science, Vol. 1123, pp. 379\u2013388 (1996).","DOI":"10.1007\/3-540-61626-8_50"},{"key":"227351_CR6","doi-asserted-by":"crossref","unstructured":"C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, Proc. Third ACM SIGPLAN Symp. Principles Practice of Parallel Programming (PPoPP'91), ACM Press, pp. 39\u201350 (1991).","DOI":"10.1145\/109626.109631"},{"key":"227351_CR7","unstructured":"J. Ferrante, W. Giloi, S. Rajopadhye, and L. Thiele (eds.), Tiling for optimal resource utilization. Technical Report 221, Schlo\u00df Dagstuhl (August 1998)."},{"key":"227351_CR8","doi-asserted-by":"crossref","unstructured":"R. Andonov, S. Rajopadhye, and N. Yanev, Optimal orthogonal tiling, Euro-Par'98: Parallel Processing, D. Pritchard and J. Reeve (eds.), Springer-Verlag, Lecture Notes in Computer Science, Vol. 1470, pp. 480\u2013490 (1998).","DOI":"10.1007\/BFb0057891"},{"key":"227351_CR9","doi-asserted-by":"crossref","unstructured":"R. Barua, D. Kranz, and A. Agarwal, Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors, Languages and Compilers for Parallel Computing (LCPC'96), D. Sehr, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (eds.), Springer-Verlag, Lecture Notes in Computer Science, Vol. 1239, pp. 350\u2013368 (1997).","DOI":"10.1007\/BFb0017263"},{"issue":"5","key":"227351_CR10","first-page":"313","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier, Some efficient solutions to the affine scheduling problem. Part I. One-dimen-sional time, IJPP\n21(5):313\u2013348 (1992).","journal-title":"IJPP"},{"issue":"6","key":"227351_CR11","first-page":"389","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multi-dimensional time, IJPP\n21(6):389\u2013420 (1992).","journal-title":"IJPP"},{"key":"227351_CR12","unstructured":"M. Wolfe, Optimizing supercompilers for supercomputers, Research Monographs in Parallel and Distributed Computing, MIT Press (1989)."},{"issue":"4","key":"227351_CR13","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/29873.29875","volume":"9","author":"J. R. Allen","year":"1997","unstructured":"J. R. Allen and K. Kennedy, Automatic translation of FORTRAN programs to vector form, ACM Trans. Progr. Lang. Syst. 9(4):491-542 (October 1997).","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"227351_CR14","unstructured":"U. Banerjee, Speedup of ordinary programs, Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Report 79\u2013989 (October 1979)."},{"issue":"2","key":"227351_CR15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0167-8191(94)00077-N","volume":"21","author":"Z. Mahjoub","year":"1995","unstructured":"Z. Mahjoub and M. Jemni, Restructuring and parallelizing a static conditional loop, Parallel Computing\n21(2):339\u2013347 (February 1995).","journal-title":"Parallel Computing"},{"key":"227351_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0928-4869(95)00041-0","volume":"4","author":"Z. Mahjoub","year":"1996","unstructured":"Z. Mahjoub and M. Jemni, On the parallelization of single dynamic conditional loops, Simulation Practice and Theory\n4:141\u2013154 (1996).","journal-title":"Simulation Practice and Theory"},{"issue":"1","key":"227351_CR17","first-page":"23","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"P. Feautrier, Dataflow analysis of array and scalar references, IJPP 20(1):23\u201353 (February 1991).","journal-title":"IJPP"},{"issue":"4","key":"227351_CR18","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1145\/183432.183525","volume":"16","author":"W. Pugh","year":"1994","unstructured":"W. Pugh and D. Wonnacott, Static analysis of upper and lower bounds on dependences and parallelism, ACM Trans. Progr. Lang. Syst. 16(4):1248\u20131278 (July 1994).","journal-title":"ACM Trans. Progr. Lang. Syst."},{"key":"227351_CR19","unstructured":"R. W. Floyd and R. Beigel, The Language of Machines-An Introduction to Compatibility and Formal Languages, Chap. 4.4, Computer Science Press (1994)."},{"issue":"7","key":"227351_CR20","first-page":"140","volume":"27","author":"W. Pugh","year":"1992","unstructured":"W. Pugh and D. Wonnacott, Eliminating false data dependences using the Omega test, Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation (PLDI'92), ACM SIGPLAN Notices\n27(7):140\u2013151 (July 1992).","journal-title":"Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation (PLDI'92), ACM SIGPLAN Notices"},{"key":"227351_CR21","unstructured":"A. Darte and F. Vivien, Automatic parallelization based on multi-dimensional scheduling. Technical Report 94-24, Laboratoire de l'Informatique du Parall\u00e9lisme, Ecole Normale Sup\u00e9rieure de Lyon (September 1994)."},{"key":"227351_CR22","unstructured":"A. Darte and F. Vivien, Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. Technical Report 96\u201306, Laboratoire de l'Infor-matique du Parall\u00e9lisme, Ecole Normale Sup\u00e9rieure de Lyon (April 1996)."},{"key":"227351_CR23","doi-asserted-by":"crossref","unstructured":"M. Griebl and C. Lengauer, The loop parallelizer LooPo-Announcement, Languages and Compilers for Parallel Computing (LCPC'96), D. Sehr, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (eds.), Springer-Verlag, Lecture Notes in Computer Science, Vol. 1239, pp. 603\u2013604 (1997).","DOI":"10.1007\/BFb0017283"},{"key":"227351_CR24","unstructured":"J.-F. Collard and M. Griebl, A precise fixpoint reaching definition analysis for arrays, Languages and Compilers for Parallel Computing (LCPC'99), J. Ferrante (ed.), Springer-Verlag, Lecture Notes in Computer Science (to appear)."},{"key":"227351_CR25","unstructured":"D. K. Arvind, K. Ebcioglu, C. Lengauer, and R. S. Schreiber, (eds.), Instruction-Level Parallelism and Parallelizing Compilation, Schlo\u00df Dagstuhl, Report 237 (1999)."},{"key":"227351_CR26","unstructured":"G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford Science Publications, Fifth ed., Oxford University Press (1990)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007516818651.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007516818651\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007516818651.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:15:21Z","timestamp":1748333721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007516818651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["227351"],"URL":"https:\/\/doi.org\/10.1023\/a:1007516818651","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}