Automatic parallelization in the polytope model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1132, Issue , 1996, Pages 79-103

  Feautrier, Paul ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROGRAMMING; SEMANTICS;

AUTOMATIC PARALLELIZATION; N-DIMENSIONAL SPACE; OPERATION RESEARCH; PARALLEL CODE; PARALLEL PROGRAM; POLYTOPE MODELS; POLYTOPES;

GEOMETRY;

EID: 84957027384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61736-1_44     Document Type: Conference Paper

References (38)

1. [AALL93] Saman P. Amarasinghe, Jennifer M. Anderson, Monica S. Lam, and Amy W. Lim. An overview of a compiler for scalable parallel machines. In Sixth Annual Workshop on Languages and Compilers for Parallel Computing., pages 253-272. Springer Verlag, LNCS 768, August 1993.
2. [AI91] Corinne Ancourt and François Irigoin. Scanning polyhedra with DO loops. In Proc. third SIGPLAN Symp. on Principles and Practice of Parallel Programming, pages 39-50. ACM Press, April 1991.
3. [ASU86] A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass, 1986.
4. [Ber66] A. J. Bernstein. Analysis of programs for parallel processing. IEEE Trans, on El. Computers, EC-15, 1966.
5. [Bra88] Thomas Brandes. The importance of direct dependences for automatic parallelization. In ACM Int. Conf. on Supercomputing, St Malo, France, July 1988.
6. [CBF95] Jean-François Collard, Denis Barthou, and Paul Feautrier. Fuzzy array dataflow analysis. In ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming. ACM, July 1995.
7. [d'A95] Patrick Le Goueslier d'Argence. Contribution à l'étude des probleèmes d'ordonnancement cycliques multidimensionnels. PhD thesis, Université Paris VI, December 1995.
8. [Dan63] G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.
9. [Dar93] A. Darte. Techniques de parallélisation automatique de nids de boucles. PhD thesis, ENS Lyon, April 1993.
10. [DKR91] Alain Darte, Leonid Khachiyan, and Yves Robert. Linear scheduling is nearly optimal. Parallel Processing Letters, 1(2):73-81, 1991.
11. [DR95] Michèle Dion and Yves Robert. Mapping affine loop nest: new results. In HPCN Conf. LNCS 919, 1995.
12. [DV94] Alain Darte and Frédéric Vivien. Automatic parallelization based on multidimensional scheduling. Technical Report RR 94-24, LIP, 1994.
13. [Fea88a] Paul Feautrier. Array expansion. In ACM Int. Conf. on Supercomputing, pages 429-441, 1988.
14. [Fea88b] Paul Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22:243-268, September 1988.
15. [Fea91] Paul Feautrier. Dataflow analysis of scalar and array references. Int. J. of Parallel Programming, 20(1):23-53, February 1991.
16. [Fea92a] Paul Feautrier. Some efficient solutions to the affine scheduling problem, I, one dimensional time. Int. J. of Parallel Programming, 21(5):313-348, October 1992.
17. [Fea92b] Paul Feautrier. Some efficient solutions to the affine scheduling problem, II, multidimensional time. Int. J. of Parallel Programming, 21(6):389- 420, December 1992.
18. [Fea94] Paul Feautrier. Toward automatic distribution. Parallel Processing Letters, 4(3):233-244, 1994.
19. [Fou90] J. B. J. Fourier. Oeuvres de fourier, tome II. Gauthier-Villard, Paris, 1890.
20. [Gom63] R. E. Gomory. An algorithm for integer solutions to linear programs. In R. L. Graves and P. Wolfe, editors, Recent Advances in Math. Programming, chapter 34, pages 269-302. Mac-Graw Hill, New York, 1963.
21. [Iri87] François Irigoin. Partitionnement de boucles imbriquées, une technique d'optimisation pour les programmes scientifiques. PhD thesis, Université P. et M. Curie, Paris, June 1987.
22. [IT87] François Irigoin and Rémi Triolet. Computing dependence direction vectors and dependence cones with linear systems. Technical Report CAI- 87-E94, Ecole des Mines de Paris, 1987.
23. [KMW67] 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.
24. [KP94] Wayne Kelly and William Pugh. Selecting affine mappings based on performance estimations. Parallel Processing Letters, 4(3):205-220, September 1994.
25. [Lam74] Leslie Lamport. The parallel execution of DO loops. CACM, 17:83-93, February 1974.
26. [Les96] Arnauld Leservot. Analyse Interprocédurale du flot des données. PhD thesis, Université Paris VI, March 1996.
27. [Lu91] Lee-Chung Lu. A unified framework for systematic loop transformations. SIGPLAN Notices, 26:28-38, July 1991. 3rd ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming.
28. [Min83] Michel Minoux. Programmation Mathématique, théorie et algorithmes. Dunod, Paris, 1983.
29. [MTH90] Robin Milner, Mads Tofte, and Robert Harper. The definition of Standard ML. The MIT Press, 1990.
30. [Pug91a] William Pugh. The omega test: A fast and practical integer programming algorithm for dependence analysis. In Supercomputing, 1991.
31. [Pug91b] William Pugh. Uniform techniques for loop optimization. ACM Conf. on Supercomputing, pages 341-352, January 1991.
32. [PW93] William Pugh and David Wonnacott. An evaluation of exact methods for analysis of value-based array data dependences. In Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing, pages 546-566. Springer-Verlag LNCS 768, August 1993.
33. [Qui87] Patrice Quinton. The systematic design of systolic arrays. In F. Fogelman, Y. Robert, and M. Tschuente, editors, Automata networks in Computer Science, pages 229-260. Manchester University Press, December 1987.
34. [RF93] Xavier Redon and Paul Feautrier. Detection of reductions in sequential programs with loops. In Arndt Bode, Mike Reeve, and Gottfried Wolf, editors, Procs. of the 5th Int. Parallel Architectures and Languages Europe, pages 132-145. LNCS 694, June 1993.
35. [Sch86] A. Schrijver. Theory of linear and integer programming. Wiley, New York, 1986.
36. [WL91] M. Wolf and Monica S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans, on Parallel and Distributed Systems, 2(4):452-471, October 1991.
37. [Xue94] J. Xue. Automating non-unimodular loop transformations for massive parallelism. Parallel Computing, 20(5):711-728, May 1994.
38. [ZBG88] H. P. Zima, H. J. Bast, and M. Gerndt. SUPERB: A tool for semiautomatic MIMD/SIMD parallelization. Parallel Computing, 6:1-18, 1988.