{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:08:01Z","timestamp":1676941681606},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"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":[[1995,8]]},"DOI":"10.1007\/bf02577771","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T19:36:25Z","timestamp":1174592185000},"page":"359-388","source":"Crossref","is-referenced-by-count":8,"title":["Minimal data dependence abstractions for loop transformations: Extended version"],"prefix":"10.1007","volume":"23","author":[{"given":"Yi-Qing","family":"Yang","sequence":"first","affiliation":[]},{"given":"Corinne","family":"Ancourt","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Irigoin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02577771_CR1","unstructured":"Y. Muraoka, Parallelism Exposure and Exploitation in Programs, Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, (February 1971)."},{"key":"BF02577771_CR2","unstructured":"M. Wolfe, Optimizing Supercompilers for Supercomputers, Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, (October 1982)."},{"key":"BF02577771_CR3","doi-asserted-by":"crossref","unstructured":"R. Allen and K. Kennedy, Automatic Translation of FORTRAN Programs to Vector Form,ACM Trans. on Programming Languages and Systems (October 1987).","DOI":"10.1145\/29873.29875"},{"key":"BF02577771_CR4","unstructured":"F. Irigoin and R. Triolet, \u201cComputing Dependence Direction Vectors and Dependence Cones with Linear Systems, Rap. Int. CAI87E94 \u00c9cole des Mines de Paris."},{"key":"BF02577771_CR5","unstructured":"A. Schrijver,Theory of Linear and Integer Programming, John Wiley & Sons (1986)."},{"key":"BF02577771_CR6","doi-asserted-by":"crossref","unstructured":"F. Irigoin and R. Triolet, \u201cSupernode Partitioning\u201d, InConf. Record of Fifteenth ACM Symp. on Principles of Programming Languages (1988).","DOI":"10.1145\/73560.73588"},{"key":"BF02577771_CR7","unstructured":"Y. Q. Yang, Tests de D\u00e9pendence et Transformations de programme, Ph.D. of University Pierre et Marie Curie, (November 1993)."},{"key":"BF02577771_CR8","doi-asserted-by":"crossref","unstructured":"William Pugh, A Practical Algorithm for Exact Array Dependence Analysis,Comm. of the ACM, pp. 102\u2013114 (August 1992).","DOI":"10.1145\/135226.135233"},{"key":"BF02577771_CR9","doi-asserted-by":"crossref","unstructured":"U. Banerjee, Loop transformations for restructuring compilers: the foundations,Kluwer Academic Editor (1993).","DOI":"10.1007\/b102311"},{"key":"BF02577771_CR10","unstructured":"U. Banerjee, Unimodular Transformation of Double Loops,3rd Workshop on Programming Languages and Compilers for Parallel Computing, Irvine, (1990)."},{"key":"BF02577771_CR11","doi-asserted-by":"crossref","unstructured":"M. E. Wolf and M. S. Lam, A Loop Transformation Theory and an Algorithm to Maximize Parallelism,Trans. on Parallel and Distributed Systems, (October 1991).","DOI":"10.1109\/71.97902"},{"key":"BF02577771_CR12","doi-asserted-by":"crossref","unstructured":"W. Li and K. Pingali, A singular loop transformation framework based on nonsingular matrices,\u201d InLanguages and Compilers for Parallel Computing, Yale University, (August 1992).","DOI":"10.1007\/3-540-57502-2_60"},{"key":"BF02577771_CR13","doi-asserted-by":"crossref","unstructured":"Dror E. Maydan, John L. Hennessy, and Monica S. Lam, Efficient and Exact Dependence Analysis,ACM Sigplan PLDI '91, Toronto, Ontario, Canada (June 1991).","DOI":"10.1145\/113445.113447"},{"key":"BF02577771_CR14","doi-asserted-by":"crossref","unstructured":"F. Irigoin, P. Jouvelot, and R. Triolet, Semantical Interprocedural Parallelization: an Overview of the PIPS Project, InACM Int. Conf. on Supercomputing, ICS '91, Cologne, Allemagne (June 1991).","DOI":"10.1145\/109025.109086"},{"key":"BF02577771_CR15","unstructured":"U. Banerjee, A Theory of Loop Permutations,2nd Workshop on Languages and Compilers for Parallel Computing (1989)."},{"key":"BF02577771_CR16","doi-asserted-by":"crossref","unstructured":"M. Wolfe, Experiences with Data Dependence Abstractions, InProc. of the 1991 ACM Intl. Conf. on Supercomputing, Germany (June 1991).","DOI":"10.1145\/109025.109104"},{"issue":"3","key":"BF02577771_CR17","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. Karp","year":"1967","unstructured":"R. Karp, R. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations,Journal of the ACM,14(3):563\u2013590 (1967).","journal-title":"Journal of the ACM"},{"issue":"2","key":"BF02577771_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L. Lamport","year":"1974","unstructured":"L. Lamport, The Parallel Execution of DO Loops,Comm. of the ACM 17(2):83\u201393 (1974).","journal-title":"Comm. of the ACM"},{"key":"BF02577771_CR19","unstructured":"E. D'hollander, Partitioning and Labeling of Index Sets in Do Loops with Constant Dependence Vectors,Int. Conf. on Parallel Processing (1989)."},{"key":"BF02577771_CR20","doi-asserted-by":"crossref","unstructured":"W. Shang and J. A. B. Fortes, Time Optimal Linear Schedules for Algorithms with Uniform Dependencies,IEEE Trans. on Computers, Vol. 40, No. 6 (June 1991).","DOI":"10.1109\/12.90251"},{"key":"BF02577771_CR21","unstructured":"A. Darte and Y. Robert, Scheduling Uniform Loop Nests, Rapport de Laboratoire de l'informatique du Parall\u00e9lisme, \u00c9cole Normale Sup\u00e9rieure de Lyon, No. 92-10, (February 1992)."},{"key":"BF02577771_CR22","unstructured":"A. Darte, T. Risset, and Y. Robert, Loop Nest Scheduling and Transformations,Conf. on Environment and Tools for Parallel Scientific Computing, CNRS-SNF, Saint-Hilaire du Touvier, France (September 1992)."},{"key":"BF02577771_CR23","unstructured":"F. Irigoin and R. Triolet, Dependence Approximation and Global Parallel Code Generation for Nested Loops, InIntl. Workshop Parallel and Distributed Algorithms, Bonas, France (October 1988)."},{"key":"BF02577771_CR24","unstructured":"F. Irigoin, Loop Reordering With Dependence Direction Vectors, InJourn\u00e9es Firtech Syst\u00e8mes et T\u00e9l\u00e9matique Architectures Futures: Programmation parall\u00e8le et int\u00e9gration VLSI, Paris (November 1988)."},{"key":"BF02577771_CR25","unstructured":"M. Wolfe, Experiences with Data Dependence and Loop Restructuring in the Tiny Research Tool, Technical Report, No. CS\/E 90-016 (September 1990)."},{"key":"BF02577771_CR26","doi-asserted-by":"crossref","unstructured":"V. Sarkar and R. Thekkath, A General Framework for Iteration-Reordering Loop Transformations, InProgramming Language Design and Implementation, San Francisco (June 1992).","DOI":"10.1145\/143095.143132"},{"key":"BF02577771_CR27","unstructured":"M. E. Wolf and M. S. Lam, Maximizing Parallelism via Loop Transformations, InProgramming Languages and Compilers for Parallel Computing (August 1\u20133, 1990)."},{"issue":"1","key":"BF02577771_CR28","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"P. Feautrier, Dataflow Analysis of Scalar and Array References,Int. Journal of Parallel Programming,20(1):23\u201353 (February 1991).","journal-title":"Int. Journal of Parallel Programming"},{"key":"BF02577771_CR29","doi-asserted-by":"crossref","unstructured":"D. Maydan, S. Amarasinghe, and M. Lam, Array Data Flow Analysis and its use in Array Privatization, Stanford Report, 1993.","DOI":"10.1145\/158511.158515"},{"key":"BF02577771_CR30","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part I, One-Dimensional Time,Int. Journal of Parallel Programming, Vol. 21, 1992.","DOI":"10.1007\/BF01407835"},{"key":"BF02577771_CR31","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, Part. II. Multi-Dimensional Time,Int. Journal of Parallel Programming, Vol. 21 (1992).","DOI":"10.1007\/BF01379404"},{"key":"BF02577771_CR32","doi-asserted-by":"crossref","unstructured":"W. Kelly and W. Pugh, Finding Legal Reordering transformations using Mappings, InSeventh Annual Workshop Languages and Compilers for Parallel Computing, Ithaca, New York (August 8\u201310, 1994).","DOI":"10.1007\/BFb0025874"},{"key":"BF02577771_CR33","doi-asserted-by":"crossref","unstructured":"A. J. Bernstein, Analysis of Programs for Parallel Processing,IEEE Trans. on Electronic Computers, Vol. EC-15, No. 5 (October 1966).","DOI":"10.1109\/PGEC.1966.264565"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02577771.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02577771\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02577771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:28:42Z","timestamp":1558322922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02577771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["BF02577771"],"URL":"https:\/\/doi.org\/10.1007\/bf02577771","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}