[1]-
A. Geist A. Beguelin, J. Dongarra, R. Manchek, and V. Sunderam.
A user's guide to pvm parallel virtual machine.
Technical report, Oak Ridge National Laboratory, September 1992.
- [2]
-
A.V. Aho, R. Sethi, and J.D. Ullman.
Compilers: Principles, Techniques and Tools.
Addison-Wesley, Reading, Mass, 1986.
- [3]
-
J.R. Allen and Ken Kennedy.
Automatic loop interchange.
In Proc. of the 1984 ACM SIGPLAN Compiler Conference,
volume 19, pages 233--246, June 1984.
- [4]
-
Zahira Ammarguellat.
A control-flow normalization algorithm and its complexity.
IEEE Transactions on Software Engineering, 18(3):237--251,
March 1992.
- [5]
-
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.
- [6]
-
H. P. Barendregt.
The Lambda Calculus, Its Syntax and Semantics.
North-Holland, Amsterdam, 1984.
- [7]
-
Denis Barthou.
Extension et améliorations pour le calcul du graphe de flot de
données.
Technical report, Institut Blaise Pascal, June 1993.
- [8]
-
C. Berge.
Graphes.
Gauthier-Villars, 1987.
- [9]
-
C. Berge.
Hypergraphes.
Gauthier-Villars, 1987.
- [10]
-
A.J. Bernstein.
Analysis of programs for parallel processing.
IEEE Trans. on El. Computers, EC-15, 1966.
- [11]
-
Jean-Yves Berthou.
Construction d'un paralléliseur interactif de logiciels
scientifiques de grande taille guidé par des mesures de performances.
PhD thesis, Université P. et M. Curie, October 1993.
- [12]
-
Guy E. Blelloch.
Prefix sums and their applications.
Technical Report CMU-CS-90-190, School of Computer Science, Carnegie
Mellon University, November 1990.
- [13]
-
Guy E. Blelloch, Siddhartha Chatterjee, and Marco Zagha.
Solving linear recurrences with loop raking.
In Proceedings Sixth International Parallel Processing
Symposium, pages 416--424, March 1992.
- [14]
-
D. Callahan.
Recognizing and parallelizing bounded recurrences.
In U. Banerjee et al. (Eds.), editor, Proc. of the Fourth
International Workshop on Languages and Compilers for Parallel Computing,
Santa Clara, CA, pages 266--282. Springer-Verlag, August 1991.
LNCS 589.
- [15]
-
J. Dongarra D. Callahan and D. Levine.
Vectorizing compilers : A test suite and results.
Proceedings of the first IEEE Supercomputing'88, pages 98--105,
November 1988.
- [16]
-
Zbigniew Chamski.
Environnement logiciel de programmation d'un accélérateur de
calcul parallèle.
PhD thesis, IFSIC, Rennes I, February 1993.
- [17]
-
R.J. Chen and Y.S. Hou.
Non-associative parallel prefix computation.
Information Processing Letters 44, pages 91--94, November 1992.
- [18]
-
J.-F. Collard.
Parallélisation automatique des programmes à contrôle
dynamique.
PhD thesis, ENS Lyon, Université Pierre et Marie Curie, January
1995.
- [19]
-
J.F. Collard, P. Feautrier, and T. Risset.
Construction of do loops from systems of affine constra ints.
Technical report, LIP, ENS-Lyon, 1993.
- [20]
-
A. Darte.
Techniques de parallélisation automatique de nids de
boucles.
PhD thesis, ENS Lyon, April 1993.
- [21]
-
Pierre David.
Analyse sémantique du langage C en vue de sa
parallélisation.
PhD thesis, Université P. et M. Curie, September 1991.
- [22]
-
Alain Dumay.
Traitement des Indexations non linéaires en parallélisation
automatique : une méthode de linéarisation contextuelle.
PhD thesis, Université P. et M. Curie, December 1992.
- [23]
-
G.-R. Perrin E. Violard.
Reduction in pei.
In Springer Verlag, editor, Proceeding of CONPAR'94 - VAPP VI
(LNCS 854), pages 112--123, September 1994.
- [24]
-
Paul Feautrier.
Projet vesta : Outil de calcul symbolique.
In 6th Int Coll on Programming, 1984.
LNCS 167.
- [25]
-
Paul Feautrier.
Parametric integer programming.
RAIRO Recherche Opérationnelle, 22:243--268, September
1988.
- [26]
-
Paul Feautrier.
Asymptotically efficent algorithms for parallel architectures.
In M. Cosnard and C. Girault, editors, Decentralized System,
pages 273--284. IFIP WG 10.3, North-Holland, December 1989.
also available as MASI Tech. report 398.
- [27]
-
Paul Feautrier.
Dataflow analysis of scalar and array references.
Int. J. of Parallel Programming, 20(1), February 1991.
- [28]
-
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.
- [29]
-
Paul Feautrier.
Some efficient solutions to the affine scheduling problem, II,
multidimensional time.
Int. J. of Parallel Programming, 21(6):389--420, December 1992.
- [30]
-
Paul Feautrier.
Compiling for massively parallel architectures.
In 3rd Workshop on Algorithms and Parallel VLSI
Architectures. Elsevier, to appear, August 1994.
- [31]
-
F .Fernandez and Patrice Quinton.
Extension of chernikova's algorithm for solving general mixed linear
programming problems.
Technical Report 437, IRISA, 1988.
- [32]
-
M.R. Garey and D.S. Johnson.
Computers and Intractability. A guide to the Theory of
NP-Completeness.
W.H. Freeman and compagny, 1979.
- [33]
-
Michael J. C. Gordon.
The Denotational Description of Programming Languages.
Springer, New York, 1979.
- [34]
-
François Irigoin, Pierre Jouvelot, and Rémi Triolet.
Overview of the pips project.
In Paul Feautrier and François Irigoin, editors, Procs of
the Int. Workshop on Compiler for Parallel Computers, Paris, pages 199--212,
December 1990.
- [35]
-
J.-M. Arnaudiès J. Lelong-Ferrand.
Cours de mathématiques Tome 1, Algèbre.
Dunod université (Bordas), 1978.
- [36]
-
Pierre Jouvelot.
Parallélisation sémantique : une approche
dénotationnelle non-standard pour la parallélisation de programmes
impératifs séquentiels.
PhD thesis, Université P. et M Curie, Paris, December 1987.
Rapport MASI RR87/174.
- [37]
-
Pierre Jouvelot and Babak Dehbonei.
A unified semantic approach for the vectorization and parallelization
of generalized reductions.
In Procs. of the 3rd Int. Conf. on Supercomputing, pages
186--194. ACM Press, 1989.
- [38]
-
Peter. M. Kogge.
The architecture of pipelined computers.
Mac-Graw Hill, New York, 1981.
- [39]
-
Peter M. Kogge and Harold S. Stone.
A parallel algorithm for the efficient solution of a general class of
recurrence equations.
IEEE Trans. on Computers, 1973.
- [40]
-
Vincent Lefebvre.
Un vectoriseur automatique pour paf.
Technical report, Institut Blaise Pascal, September 1993.
- [41]
-
H. Leverge.
Reduction operators in alpha.
In D. Etiemble and J.-C. Syre, editors, Proc. PARLE'87, pages
397--411. LNCS 605, Springer Verlag Ed., 1992.
- [42]
-
Hanoch Levy and David W. Low.
A contraction algorithm for finding small cycle cutsets.
Journal of Algorithms, 9:470--493, 1988.
- [43]
-
David Loveman.
High performance fortran.
In Hans P. Zima, editor, Proceedings of the Third Workshop on
Compilers for Parallel Computers, Vienna, July 1992.
- [44]
-
Y.-I. Choo M. Chen and J. Li.
Crystal: From functional description to efficient parallel code.
In G. Fox, editor, Proc. of the Third Conference on Hypercube
Concurrent Computers and Applications, pages 417--433. ACM, New York, USA,
1988.
- [45]
-
Christophe Mauras.
Alpha : un langage équationnel pour la conception et la
programmation d'architectures parallèles synchrones.
PhD thesis, Université de Rennes I, December 1989.
- [46]
-
Bernard Philippe Michèle Raphalen.
Précision numérique dans le cumul d'un nombre de termes.
Technical Report Publication interne 253, Institut de recherche en
informatique et systemes aleatoires (IRISA), April 1985.
- [47]
-
R. Pinter and S. Pinter.
Program optimization and parallelization using idioms.
In ACM PoPL, 1991.
- [48]
-
William Pugh.
Uniform techniques for loop optimization.
ACM Conf. on Supercomputing, pages 341--352, January 1991.
- [49]
-
William Pugh.
Counting solutions to presburger formulas: How and why.
In SIGPLAN Conference on Programming Language Design and
Implementation, Orlando, FL, June 1994.
- [50]
-
P. Quinton.
Mapping recurrences on parallel architectures.
In Third International Conference on Supercomputing, volume 3,
pages 1--8, Boston (U.S.A), May 1988.
- [51]
-
Mourad Raji-Werth and P. Feautrier.
On parallel program generation for massively parallel architectures.
In M. Durand and F. El Dabaghi, editors, High Performance
Computing II. North-Holland, October 1991.
- [52]
-
Mourad Raji-Werth and Paul Feautrier.
Systematic construction of programs for distributed memory systems.
In Paul Feautrier and François Irigoin, editors, Procs of
the Int. Workshop on Compiler for Parallel Computers, Paris, December 1990.
- [53]
-
S. Rajopadhye.
Lacs: A language for affine communication structures.
Technical report, IRISA, 1993.
- [54]
-
Rama N. Reddy and Carol A. Ziegler.
Fortran 77, with Application for Scientists and Engineers.
West Publishing Compagny, 1989.
- [55]
-
X. Redon and P. Feautrier.
Detection of reductions in sequentials programs with loops.
In Arndt Bode, Mike Reeve, and Gottfried Wolf, editors, Procs of
the 5th International Parallel Architectures and Languages Europe, pages
132--145, June 1993.
- [56]
-
Xavier Redon.
Traitement des tests structuraux.
Groupe ``Calcul Parallèle'' du MASI, November 1991.
available on request from Paul Feautrier.
- [57]
-
Julius T. Schwartz.
Ultracomputers.
ACM Transactions on Programming Languages and Systems, pages
484--521, 1980.
- [58]
-
A. Shamir.
linear time algorithm for finding minimum cutsets in reducible
graphs.
SIAM J. Comput., 8(4):645--655, 1979.
- [59]
-
Nadia Tawbi.
Parallélisation Automatique : Estimation des Durées
d'Exécution et Allocation Statique de Processeurs.
PhD thesis, Université P. et M. Curie, Paris, 1991.
19 Avril 1991.
- [60]
-
Nadia Tawbi.
Estimation of nested loop execution time by integer arithmetics in
convex polyhedra.
In Proc of the 1994 International Parallel Processing
Symposium, April 1994.
- [61]
-
James C. Tiernan.
An efficient search algorithm to find the elementary circuits of a
graph.
In Communications of the ACM, volume 12(3), 1970.
- [62]
-
H. Le Verge, V. Van Dongen, and D. K. Wilde.
La synthèse de nids de boucles avec la bibliothèque
polyédrique.
In L. Bougé et al., editor, 6me Rencontres francophones
du parallélisme, pages 73--76, Lyon, June 1994.
- [63]
-
E. Violard and G.-R. Perrin.
PEI : a single unifying model to design parallel programs.
In PARLE'93. LNCS 694, Springer Verlag, 1993.
- [64]
-
D. Wilde.
A library for doing polyhedral operations.
Technical Report Internal Publication 785, IRISA, Rennes, France, Dec
1993.
Also published as INRIA Research Report 2157.
- [65]
-
Michael J. Wolfe.
Optimizing Supercompilers for Supercomputers.
Pitman and The MIT Press, 1989.