{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T14:14:06Z","timestamp":1780755246482,"version":"3.54.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":[[1992,10]]},"DOI":"10.1007\/bf01407835","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T06:47:31Z","timestamp":1112510851000},"page":"313-347","source":"Crossref","is-referenced-by-count":342,"title":["Some efficient solutions to the affine scheduling problem. I. One-dimensional time"],"prefix":"10.1007","volume":"21","author":[{"given":"Paul","family":"Feautrier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Paul Feautrier, Asymptotically efficient algorithms for parallel architectures, M. Cosnard and C. Girault (eds.), IFIP WG 10.3, North-Holland,Decentralized System, pp. 273?284 (December 1989)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Patrice Quinton and V. van Dongen, The mapping of linear recurrence equations on regular arrays, submitted toThe Journal of VLSI Signal Processing (September 1988).","DOI":"10.1007\/BF02477176"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-8191(90)90105-I","volume":"14","author":"Sanjay V. Rajopadhye","year":"1990","unstructured":"Sanjay V. Rajopadhye and Richard M. Fujimoto, Synthesizing systolic rays from recurrence equations.Parallel Computing 14:163?189 (1990).","journal-title":"Parallel Computing"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"Leslie Lamport","year":"1974","unstructured":"Leslie Lamport, The parallel execution of do loops.CACM 17:83?93 (February 1974).","journal-title":"CACM"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-8191(90)90055-E","volume":"16","author":"Michael L. Dowling","year":"1990","unstructured":"Michael L. Dowling, Optimal code parallelization using unimodular transformations,Parallel Computing 16:157?171 (1990).","journal-title":"Parallel Computing"},{"key":"CR6","unstructured":"Mourad Raji-Werth and Paul Feautrier, Systematic construction of program for distributed memory systems, Paul Feautrier and Fran\u00e7ois Irigoin (eds.),Proc. of the Int'l. Workshop on Compiler for Parallel Computers, Paris (December 1990)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"William Pugh, Uniform techniques for loop optimization,ACM Conf. on Supercomputing, pp. 341?352 (January 1991).","DOI":"10.1145\/109025.109108"},{"key":"CR8","first-page":"28","volume":"26","author":"Lee-Chung Lu","year":"1991","unstructured":"Lee-Chung Lu, A unified framework for systematic loop transformations,SIGPLAN Notices, Third ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming 26, 28?38 (July 1991).","journal-title":"SIGPLAN Notices, Third ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming"},{"key":"CR9","unstructured":"Alain Darte and Yves Robert, Mapping Uniform Loop Nests onto Distributed Memory Architectures, Technical Report 93-03, LIP-IMAG (January 1993)."},{"key":"CR10","unstructured":"Paul Feautrier, Some efficient solutions to the affine scheduling problem, Part II, multidimensional time,IJPP (to appear). Also available as IBP-MASI Research Report 92.78."},{"key":"CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming, Wiley, New York (1986)."},{"issue":"1","key":"CR12","first-page":"23","volume":"20","author":"Paul Feautrier","year":"1991","unstructured":"Paul Feautrier, Dataflow analysis of scalar and array references,IJPP 20(1):23?53 (February 1991).","journal-title":"IJPP"},{"issue":"6","key":"CR13","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/502949.502897","volume":"19","author":"J. R. Allen","year":"1984","unstructured":"J. R. Allen and Ken Kennedy, Automatic loop interchange,SIGPLAN Notices 19(6):233?246 (June 1984).","journal-title":"SIGPLAN Notices"},{"key":"CR14","unstructured":"Michael J. Wolfe,Optimizing Supercompilers for Supercomputers, Pitman and The MIT Press (1989)."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Irigoin and R\u00e9mi Triolet, Supernode partitioning,Proc. 15th POPL, San Diego, California, pp. 319?328 (January 1988).","DOI":"10.1145\/73560.73588"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. M. Karp","year":"1967","unstructured":"R. M. Karp, R. E. Miller, and S. Winograd, The organization of computations for uniform recurrence equations.Journal of the ACM 14:563?590 (1967).","journal-title":"Journal of the ACM"},{"key":"CR17","volume-title":"La Contruction de Programmes Structur\u00e9s","author":"Jacques Arsac","year":"1977","unstructured":"Jacques Arsac,La Contruction de Programmes Structur\u00e9s, Dunod, Paris (1977)."},{"key":"CR18","unstructured":"E. A. Ashcroft and W. W. Wadge,Lucid, the Data-flow Programming Language, Academic Press (1985)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"L. G. Tesler and H. J. Enea, A language design for concurrent processes,SJCC, pp. 403?408 (1968).","DOI":"10.1145\/1468075.1468134"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Marina C. Chen, A parallel language and its compilation to multiprocessor machines for VLSI,Proc. ACM POPL (1986).","DOI":"10.1145\/512644.512656"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00925828","volume":"3","author":"Herv\u00e9 Leverge","year":"1991","unstructured":"Herv\u00e9 Leverge, Christophe Mauras, and Patrice Quinton, TheALPHA language and its use for the design of systolic arrays,Journal of VLSI Signal Processing 3:173?182 (1991).","journal-title":"Journal of VLSI Signal Processing"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Paul Feautrier, Array expansion,ACM Int'l. Conf. on Supercomputing, St. Malo (1988).","DOI":"10.1145\/55364.55406"},{"key":"CR23","first-page":"603","volume":"40","author":"Joel H. Salz","year":"1881","unstructured":"Joel H. Salz, Ravi Mirchandaney, and Kay Crowley, Run-time parallelization and scheduling of loops,IEEE Trans. on Computers 40:603?612 (May 1881).","journal-title":"IEEE Trans. on Computers"},{"key":"CR24","unstructured":"Brigitte Jouannault, Conception d'algorithmes et d'architectures systoliques, PhD Thesis, Universit\u00e9 de Rennes I (September 1987)."},{"key":"CR25","unstructured":"Yannick Saouter and Patrice Quinton, Computability of Recurrence Equations, Technical Report 521, IRISA (February 1990)."},{"key":"CR26","unstructured":"Patrice Quinton, The systematic design of systolic arrays, F. Fogelman, Y. Robert, and M. Tschuente (eds.), Manchester University Press,Automata Networks in Computer Science, pp. 229?260 (December 1987)."},{"key":"CR27","unstructured":"Alain Darte and Yves Robert, Affine-by-statement Scheduling of Uniform Loop Nest over Parametric Domains, Technical Report 92-16, LIP-IMAG (April 1992)."},{"key":"CR28","unstructured":"Herv\u00e9 Leverge, A note on Chernikova's algorithm, Technical Report 635, INRIA (May 1992)."},{"key":"CR29","unstructured":"Paul Feautrier and Nadia Tawbi R\u00e9solution de Syst\u00e8mes d'In\u00e9quations Lin\u00e9aires; mode d'emploi du logiciel PIP, Technical Report 90.2, IBP-MASI (January 1990)."},{"key":"CR30","unstructured":"Christophe Mauras, Patrice Quinton, Sanjay Rajopadhye, and Yannick Saouter, Scheduling Affine Parameterized Recurrences by means of Variable Dependent Timing Functions, Technical Report 1204, INRIA (April 1990)."},{"issue":"6","key":"CR31","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/12.90251","volume":"40","author":"Weijia Shang","year":"1991","unstructured":"Weijia Shang and Jose A. B. Fortes, Time optimal linear schedules for algorithms with uniform dependencies.IEEE Transactions on Computers 40(6):723?742 (June 1991).","journal-title":"IEEE Transactions on Computers"},{"key":"CR32","unstructured":"Alain Darte, Leonid Kachian, and Yves Robert, Linear Scheduling is Nearly Optimal, Technical Report 91-35, LIP-IMAG (November 1991). To appear inParallel Processing Letters."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407835.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01407835\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:37:59Z","timestamp":1683059879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01407835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["BF01407835"],"URL":"https:\/\/doi.org\/10.1007\/bf01407835","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}