1. L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors. EuroPar'96, LNCS 1123-1124, 1996. Springer Verlag. [bibtex-entry]

1. Fatima Boumghar, Serge Miguet, and Jean-Marc Nicod. Optimisation et dénombrement des points d'une surface discrète. Int. Journal of CADCAM and Computer Graphics/Revue Internationale de CFAO et d'Informatique Graphique, 11(4):467--480, 1996. [bibtex-entry]



2. Alain Darte, Frédéric Desprez, Jean-Christophe Mignot, and Yves Robert. TransTOOL: A restructuring tool for the parallelization of applications using High Performance Fortran. Journal of the Brazilian Computer Society, 3(2):5-15, 1996. [bibtex-entry]



3. Alain Darte, Michèle Dion, and Yves Robert. A characterization of one-to-one modular mappings. Parallel Processing Letters, 5:145-157, 1996. [bibtex-entry]



4. Michèle Dion, Cyril Randriamaro, and Yves Robert. Compiling affine nested loops: how to optimize the residual communications after the alignment phase?. J. Parallel and Distributed Computing, 38(2):176-187, 1996. [bibtex-entry]



5. Michèle Dion, Tanguy Risset, and Yves Robert. Resource-constrained scheduling of partitioned algorithms on processor arrays. Integration, the VLSI Journal, 20:139-159, 1996. [bibtex-entry]



6. Michèle Dion and Yves Robert. Mapping affine loop nests. Parallel Computing, 22(10):1373-1397, 1996. [bibtex-entry]

1. Fatima Boumghar, Serge Miguet, and Jean-Marc Nicod. Complexity of Discrete Surface in the Dividing-Cubes algorithm. In A. Ferreira, S. Miguet, and A. Montanvert, editors, Discrete Geometry for Computer Imagery (DGCI'96), volume 1176 of LNCS, ENS Lyon, France, November 1996. LIP-ENS Lyon, Springer Verlag. [bibtex-entry]



2. Pierre-Yves Calland, Alain Darte, and Yves Robert. A new guaranteed heuristic for the software pipelining problem. In Tenth ACM International Conference on Supercomputing, pages 261-269, 1996. ACM Computer Science Press. [bibtex-entry]



3. Pierre-Yves Calland, Alain Darte, Yves Robert, and Frédéric Vivien. On the removal of anti and output dependences. In J. Fortes, C. Mongenet, K. Parhi, and V. Taylor, editors, Application Specific Systems, Architectures and Processors, pages 353-364, 1996. IEEE Computer Society Press. [bibtex-entry]



4. Alain Darte and Frédéric Vivien. Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs. In Proceedings of Parallel Architectures and Compilation Techniques (PACT'96), Boston, MA, USA, pages 281--291, October 1996. IEEE Computer Society Press. [bibtex-entry]



5. Alain Darte and Frédéric Vivien. On the Optimality of Allen and Kennedy's Algorithm for Parallelism Extraction in Nested Loops. In Proceedings of Euro-Par'96, volume 1123 of LNCS, Lyon, France, pages 379--388, August 1996. Springer-Verlag. [bibtex-entry]



6. Michel J. Daydé, Jérôme P. Décamps, Jean-Yves L'Excellent, and Nicholas I. M. Gould. Solution of large-scale partially separable optimization problems using element-by-element preconditioners. In Poster Session of the Fifth SIAM Conference on Optimization, Victoria, British Colombia, Canada, 1996. [bibtex-entry]



7. Michèle Dion, Cyril Randriamaro, and Yves Robert. How to optimize residual communications ?. In 10th International Parallel Processing Symposium, pages 382-391, 1996. IEEE Computer Society Press. [bibtex-entry]

1. Alain Darte, Georges-André Silber, and Frédéric Vivien. Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling. Research report 96--34, Laboratoire de l'informatique de parallélisme (LIP), École normale supérieure de Lyon, France, November 1996.
   Note: Rlftp://ftp.lip.ens-lyon.fr/pub/LIP/Rapports/RR/RR96/RR96-34.ps.Z. [bibtex-entry]



2. Alain Darte, Georges-André Silber, and Frédéric Vivien. Combining retiming and scheduling techniques for loop parallelization and loop tiling. Research report 96-34, LIP, ENS-Lyon, France, November 1996. [bibtex-entry]



3. Alain Darte and Frédéric Vivien. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. Research report 96-06, LIP, ENS-Lyon, France, April 1996.
   Note: Published in the International Journal of Parallel Programming 25(6):447--496, 1997. [bibtex-entry]



4. Alain Darte and Frédéric Vivien. On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops. Research report 96-05, LIP, ENS-Lyon, France, February 1996.
   Note: Extended version of Europar'96. [bibtex-entry]



5. Michel J. Daydé, Jér ôme P. Décamps, Jean-Yves L'Excellent, and Nicholas I. M. Gould. On the solution of large scale partially separable unconstrained optimization problems using element-by-element preconditioners. Research report RT/APO/96/3, ENSEEIHT-IRIT, Toulouse, France, 1996. [bibtex-entry]



6. Michel J. Daydé, Jean-Yves L'Excellent, and Nicholas I. M. Gould. On the Preprocessing of Sparse Unassembled Linear Systems for Efficient Solution Using Element-by-element Preconditioners. Research report RT/APO/96/2, ENSEEIHT-IRIT, 1996. [bibtex-entry]

1. Eddy Caron. Faisabilité d'un compilateur de langage data-parallèle traitant les matrices creuses. Mémoire de D.E.A., Université de Picardie Jules Vernes Amiens, July 1996.
   Keywords: Creux. [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html