Corinne Ancourt
- 1.J. R. Allen, K. Kennedy, Automatic Loop inte#hange, SIGPLAN'84 Symposium on Compiler Construction, SIGPLAN Notices, 19, 1984 Google Scholar
Digital Library
- 2.1#. Allen, D. Callahan, K. Kennedy, Automatic Decomposition of Scientific Programs Joe Parallel Ezeeution, ACM Symposium on Principles of Programming Languages, Munich, 1987 Google ScholarDigital Library
- 3.A. Aiksn, A. Nicolau, Loop Quantization: An Analysis and Algorithm, Tech. P#ep. 87-221, Cornell Univ., 1987 Google ScholarDigital Library
- 4.C. Ancourt, Gdndration de code pour multiproceueurs d mdmoires locales, Th#se de l'Univezsit# Pierre et Marie Cuxie, in progressGoogle Scholar
- 5.U. Banerjee, A Theory of Loop Permutations, 2nd Workshop on Languages and compilers for parallel computing, 1989 Google ScholarDigital Library
- 6.U. Banerjee, Unimodular Transformation of Double Loops, 3rd Workshop on Programming Languages and Compilers for Paxallel Computing, ixvine, 1990Google Scholar
- 7.M. C. Cheng, General Criteria for Redundant and Nonredundant Linear Inequalities, Journal of Optimization Theory and Applications, vol. 53, No 1, April 1987. Google ScholarDigital Library
- 8.R. J. DutKu, On Fourier's Analysis of Linear Inequality Systems, Mathematical Programming Study 1, North- HoUemd, 1974Google Scholar
- 9.J.B.J. Fourier, Analyse de travauz de l'Acaddmie Royale des Sciences, pendant l'annde 182#, pattie mathdmatique, Histolre de l'Acad#mie Royale des Sciences de l'institut de France, 1827.Google Scholar
- 10.K. Gallivan, W. Jalby and D. Gmmon, On the Problem of Optimizing Data Transferts for Comple# Mere. or'y Systems, Proceeding of the ACM Int'l Conf. on Supereomputing, St-Malo, 1988. Google ScholarDigital Library
- 11.E. D'Hollander, Partitioning and Labeling of Indez Sets in DO Loops with Constant Dependence Vectors, 1989 Int#l Conference on Paxal}el Processing, pp. II-139, I1- 144 (Aug. 1988)Google Scholar
- 12.F. Ixigoin, Code Generation for the Hype#plane Method and Loop Interchange, report ENSMP-CAI-88-E102, CAI, Ecole des Mines de Paris, 1988Google Scholar
- 13.F. Ixigoin, Loop Reordering #oith Dependence Direction Vectors, Joura#es Firtech Syst#mes et T#l#matlque Axchitectuxe Futuxes: prog#ammation paxall#le et integration VLSI, Paa4j, 9-10 novembze 1988Google Scholar
- 14.F. Trigoin, R. Triolet, Computing Dependence Direction Vectors and Dependence Cones with Linear Systems, report ENSMP-CAI-87-E94, CA.{, Ecole des Mines de Paxis, 1987Google Scholar
- 15.F. L--igoin, R. Trlolet, Supernode Partitioning, ACM Symposium on Principles of Pzogrammlng Languages, San-Diego, 1988 Google ScholarDigital Library
- 16.F. Irigoin, R. Triolet, Dependence Approximation and Global Parallel Code Generation Joe Nested Loops, International Workshop on Parallel and Distributed Algorithms, Bonas, Oct. 3-6, 1988, North-HollandGoogle Scholar
- 17.F. Irigoin, P. Jouvelot, R. "l#iolet, Overeiew of the PIPS project, International Workshop on Compilers for Paxallel Computers, Paris, December 3-5, 1990.Google Scholar
- 18.R. Kaa#, R. Miller and S. Winograd, The Organization of Computations .for Uniform Recurence Equations, Journal of the ACM, v. 14, n. 3, pp. 563-590, 1967 Google ScholarDigital Library
- 19.L. Lampozt, The Parallel Effiecutlon of DO Loops, Communications of the ACM 17(2), pp. 83-93, 1974 Google ScholarDigital Library
- 20.D. Loveman, Program Improvement by Source.to- Source Transformations, J. of the ACM, V. 20, n. 1. Google ScholarDigital Library
- 21.P. A. Padua Haiek, Multiprocessors: Discttssion of Some Theoretical and Practical Problems, PtLD Dissertation, Report No. Ul'UCDCS-R-79-990, University of IIllnois at Urbana-Chaxnpaign, 1979 Google ScholarDigital Library
- 22.D. A. Padua, M. J. Wolfe, Advanced Compiler Optimizations for Supercomputers, Communications of the ACM, Vol. 29, n. 12, 1986 Google ScholarDigital Library
- 23.J.-K. Pelt, Program Partitioning and S#chronization on Multiprocessors Systems, Ph.D. Thesis, report UIUCDCS-K-86-1259, University of Illinois at Urbana- Champaign (Maxch 1986)Google Scholar
- 24.A. Porterfield, Software Methods for Improvement of cache Performance on Supercomputer Applications, Rice COMP TR89-93, Rice University, 1989Google Scholar
- 25.W. Shemg, J. A. Fortes, Independent Partitioning of Algorithms with Uniyoryn Dependencies, 1988 Intrl Confezence on Parallel Processing, pp. 26-33 (Aug. 1988)Google Scholar
- 26.A. Schrijver, Theory of Linear and integer Programming, Wiley, 1986 Google ScholarDigital Library
- 27.A. E. Ter#ano, Optimal Tiling for Iterative PDE Solvers, F#ontiexs of Memively Parallel Computation, 1988Google Scholar
- 28.M. Wolf, M. Lam, Mazimizing Paralellism via Loop Trans/ormations, 3rd Workshop on Programming Languages and Compilers for Paxallel Computing, Ixvine, 1990Google Scholar
- 29.M. Wolfe, Optimizing ,#qupercompilers for Supercomput. ers, Ph.D. thesis University of Illinois, Urbana, Rep. no UIUCDCS-R-82-1105, 1982. Google ScholarDigital Library
- 30.M. Wolfe, Loop Skewing: The tlra#e#ont Method Revisited, int'l Journal of Paxallel Programming, V. 15, n. 4, 1986, pp. 279-294 Google ScholarDigital Library
- 31.M. Wolfe, Iteration Space Tiling for Memory tIierar. chics, in Parallel Processing for Scientific Computing, G. Rodrigue (ed.), SIAM, 1989, pp. 357-361 Google Scholar
- 32.M. Wolfe, Optimizing Supercompilers for Supercornpu#. era, MIT Press, 1989 Google ScholarDigital Library
- 33.M. Wolfe, More Iteration Space Tiling, Supezcomputing 89, Reno, 1989, pp. 655-664 Google ScholarDigital Library
Index Terms
- Scanning polyhedra with DO loops
Recommendations
Scanning Polyhedra without Do-loops
PACT '98: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation TechniquesWe study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of related works, we detail our method to scan affine images of polyhedra. ...
Parallelizing tightly nested loops
IPPS '91: Proceedings of the Fifth International Parallel Processing SymposiumPresents a new technique to parallelize nested loops at the statement level. It transforms sequential nested loops, either vectorizable or not, into parallel ones. Previously, the wavefront method was used to parallelize non-vectorizable nested loops. ...
Software Pipelining of Nested Loops
CC '01: Proceedings of the 10th International Conference on Compiler ConstructionSoftware pipelining is a technique to improve the performance of a loop by overlapping the execution of several iterations. The execution of a software-pipelined loop goes through three phases: prolog, kernel, and epilog. Software pipelining works best ...
Comments