{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:32:21Z","timestamp":1736400741283,"version":"3.32.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2006,5,17]],"date-time":"2006-05-17T00:00:00Z","timestamp":1147824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2006,10,11]]},"DOI":"10.1007\/s10766-006-0011-4","type":"journal-article","created":{"date-parts":[[2006,5,16]],"date-time":"2006-05-16T17:15:41Z","timestamp":1147799741000},"page":"459-487","source":"Crossref","is-referenced-by-count":19,"title":["Scalable and Structured Scheduling"],"prefix":"10.1007","volume":"34","author":[{"given":"Paul","family":"Feautrier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"C. Ancourt and F. Irigoin, Scanning polyhedra with DO Loops, in Proceedings of the third SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 39\u201350. ACM Press, April 1991.","DOI":"10.1145\/109626.109631"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"C. Bastoul, Efficient Code Generation for Automatic Parallelization and Optimization, in ISPDC\u201903 IEEE International Symposium on Parallel and Distributed Computing, pp. 23\u201330. Ljublana, October 2003.","DOI":"10.1109\/ISPDC.2003.1267639"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"A. J. Bernstein, Analysis of Programs for Parallel Processing, IEEE Transactions on El. Computers, EC-15, 1966.","DOI":"10.1109\/PGEC.1966.264565"},{"key":"11_CR4","unstructured":"P. Boulet and P. Feautrier, Scanning Polyhedra without DO Loops, in PACT\u201998, October 1998."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"A. Darte, R. Schreiber and G. Villard, Lattice-based Memory Allocation, in sixth ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES 2003), October 2003.","DOI":"10.1145\/951710.951749"},{"key":"11_CR6","unstructured":"P. Feautrier, Semantical Analysis and Mathematical Programming: Application to Parallelization and Vectorization, in M. Cosnard, Y. Robert, P. Quinton, and M. Raynal, eds., Workshop on Parallel and Distributed Algorithms, Bonas, pp. 309\u2013320. North Holland, 1989."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Dataflow Analysis of Scalar and Array References. International Journal of Parallel Programming 20(1):23\u201353, February 1991.","DOI":"10.1007\/BF01407931"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, I, One-dimensional Time, International Journal of Parallel Programming, 21(5):313\u2013348, October 1992.","DOI":"10.1007\/BF01407835"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, II, Multidimensional Time, International Journal of Parallel Programming, 21(6):389\u2013420, December 1992.","DOI":"10.1007\/BF01379404"},{"issue":"6","key":"11_CR10","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1023\/A:1007516818651","volume":"28","author":"M. Griebl","year":"2000","unstructured":"Griebl M., Feautrier P., Lengauer C. (2000). Index Set Splitting. International Journal of Parallel Programming 28(6):607\u2013631","journal-title":"International Journal of Parallel Programming"},{"key":"11_CR11","unstructured":"G. Kahn, The Semantics of a Simple Language for Parallel Programming, in IFIP\u201994, pp. 471\u2013475. North Holland 1974."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"H. Leverge, C. Mauras and P. Quinton. The ALPHA Language and its Use for the Design of Systolic Arrays, Journal of VLSI Signal Processing, 3:173\u2013182, 1991.","DOI":"10.1007\/BF00925828"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"P. Quinton and T. Risset, Structured Scheduling of Recurrence Equations: Theory and Practice, in Proceedings of the System Architecture Modelling and Simulation Workshop, Lecture Notes in Computer Science, 2268, Samos, Greece, 2001. Springer Verlag.","DOI":"10.1007\/3-540-45874-3_7"},{"key":"11_CR14","unstructured":"P. Quinton, The Systematic Design of Systolic Arrays, in F. Fogelman, Y. Robert and M. Tschuente, eds., Automata Networks in Computer Science, pp. 229\u2013260. Manchester University Press, December 1987."},{"key":"11_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A. (1986). Theory of Linear and Integer Programming. Wiley, NewYork"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Robert E. Tarjan, Graph Theory and Gaussian Elimination, in J. Bunch and D. Rose, eds., Sparse Matrix Computations. Academic Press, 1976.","DOI":"10.1016\/B978-0-12-141050-6.50006-4"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"W. Thies, F. Vivien, J. Sheldon and S. Amarasinghe, A unified framework for schedule and storage optimization, in ACM SIGPLAN\u201901 Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, June 2001.","DOI":"10.1145\/378795.378852"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"R. Triolet, F. Irigoin and P. Feautrier, Automatic Parallelization of FORTRAN Programs in the Presence of Procedure Calls, in B. Robinet and R. Wilhelm, eds., ESOP 1986, LNCS 213. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16442-1_16"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-006-0011-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-006-0011-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-006-0011-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T00:09:44Z","timestamp":1736381384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-006-0011-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,17]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,10,11]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s10766-006-0011-4","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2006,5,17]]}}}