1. S. Pande, J. Ramanujam, and Y. Robert, editors. Special issue on Compiling for scalable parallel systems, 1997. Parallel Processing Letters 7, 4.
   

   @Proceedings{ ProceedingsPande.PRR_97,
   editor = {S. Pande and J. Ramanujam and Y. Robert},
   publisher = {Parallel Processing Letters 7, 4},
   title = {Special issue on {\em Compiling for scalable parallel systems}},
   year = {1997} 
   }
   

1. Frédéric Vivien. Détection de parallélisme dans les boucles imbriquées. PhD thesis, École normale supérieure de Lyon, France, December 1997.
   

   @PhDThesis{ PhDThesisPhD-Vivien_97,
   author = {Fr\'ed\'eric Vivien},
   address = {France},
   month = dec,
   school = {\'Ecole normale sup\'erieure de Lyon},
   title = {D\'etection de parall\'elisme dans les boucles imbriqu\'ees},
   year = {1997} 
   }
   

1. Pierre-Yves Calland, Alain Darte, Yves Robert, and Frédéric Vivien. Plugging anti and output dependence removal techniques into loop parallelization algorithms. Parallel Computing, 23(1-2):251-266, 1997.
   

   @Article{ ArticleCalland.CDRV_PC97,
   author = {Pierre-Yves Calland and Alain Darte and Yves Robert and Fr\'ed\'eric Vivien},
   journal = {Parallel Computing},
   title = {Plugging anti and output dependence removal techniques into loop parallelization algorithms},
   pages = {251-266},
   number = {1-2},
   volume = {23},
   year = {1997} 
   }
   




2. Alain Darte, Georges-André Silber, and Frédéric Vivien. Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling. Parallel Processing Letters, 7(4):379--392, December 1997.

   Abstract:

   "Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take advantage of the structure of dependences between different statements. In this paper, we overcome this limitation by showing how the structure of the reduced dependence graph can be taken into account for detecting more permutable loops. Our method combines graph retiming techniques and graph scheduling techniques. It can be viewed as an extension of the Wolf and Lam's algorithm to the case of loops with multiple statements. Loop independent dependences play a particular role in our study, and we show how the way we handle them can be useful for fine-grain parallelization as well."

   
   

   @Article{ ArticleDarte.DSV_PPL97,
   author = "Alain Darte and Georges-Andr\'e Silber and Fr\'ed\'eric Vivien",
   title = {{C}ombining {R}etiming and {S}cheduling {T}echniques for {L}oop {P}arallelization and {L}oop {T}iling},
   journal = "Parallel Processing Letters",
   year = 1997,
   volume = 7,
   number = 4,
   month = dec,
   pages = "379--392",
   abstract = "Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take advantage of the structure of dependences between different statements. In this paper, we overcome this limitation by showing how the structure of the reduced dependence graph can be taken into account for detecting more permutable loops. Our method combines graph retiming techniques and graph scheduling techniques. It can be viewed as an extension of the Wolf and Lam's algorithm to the case of loops with multiple statements. Loop independent dependences play a particular role in our study, and we show how the way we handle them can be useful for fine-grain parallelization as well." 
   }
   




3. Alain Darte and Frédéric Vivien. Parallelizing Nested Loops with Approximation of Distance Vectors: A Survey. Parallel Processing Letters, 7(2):133--144, June 1997.
   

   @Article{ ArticleDarte.DV_PPL97,
   author = {Alain Darte and Fr\'ed\'eric Vivien},
   journal = {Parallel Processing Letters},
   month = jun,
   number = {2},
   pages = {133--144},
   title = {Parallelizing {N}ested {L}oops with {A}pproximation of {D}istance {V}ectors: {A} {S}urvey},
   volume = {7},
   year = {1997} 
   }
   




4. Alain Darte and Frédéric Vivien. Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs. International Journal of Parallel Programming, 25(6):447--496, December 1997.
   

   @Article{ ArticleDarte.DV_IJPP97,
   author = {Alain Darte and Fr\'ed\'eric Vivien},
   journal = {International Journal of Parallel Programming},
   number = {6},
   pages = {447--496},
   title = {Optimal {F}ine and {M}edium {G}rain {P}arallelism {D}etection in {P}olyhedral {R}educed {D}ependence {G}raphs},
   volume = {25},
   year = {1997},
   month = dec 
   }
   




5. Alain Darte and Frédéric Vivien. On the Optimality of Allen and Kennedy's Algorithm for Parallelism Extraction in Nested Loops. Journal of Parallel Algorithms and Applications, 12(1-3):83-112, 1997.
   Note: Special issue on Optimizing Compilers for Parallel Languages.
   

   @Article{ ArticleDarte.DV_JPAA97,
   author = {Alain Darte and Fr\'ed\'eric Vivien},
   journal = {Journal of Parallel Algorithms and Applications},
   note = {Special issue on "Optimizing Compilers for Parallel Languages"},
   pages = {83-112},
   title = {On the Optimality of {A}llen and {K}ennedy's Algorithm for Parallelism Extraction in Nested Loops},
   volume = {12},
   year = {1997},
   number = {1-3} 
   }
   




6. Michel J. Daydé, Jean-Yves L'Excellent, and Nicholas I. M. Gould. Element-by-Element Preconditioners for Large Partially Separable Optimization Problems. SIAM Journal on Scientific Computing, 18(6):1767--1787, 1997.
   

   @Article{ ArticleDayde.DLG_SJSC97,
   author = {Michel J. Dayd\'e and Jean-Yves L'Excellent and Nicholas I. M. Gould},
   title = {Element-by-Element Preconditioners for Large Partially Separable Optimization Problems},
   journal = {SIAM Journal on Scientific Computing},
   volume = {18(6)},
   pages = {1767--1787},
   year = 1997 
   }
   




7. Serge Miguet and Jean-Marc Nicod. Complexity analysis of a parallel Marching-Cubes. International Journal of Pattern Recognition and Artificial Intelligence, 11(7):1024--1041, 1997.
   

   @Article{ ArticleMiguet.MN_IJPRAI97,
   author = {Miguet, Serge and Nicod, Jean-Marc},
   title = {Complexity analysis of a parallel Marching-Cubes},
   journal = {International Journal of Pattern Recognition and Artificial Intelligence},
   volume = 11,
   number = 7,
   pages = {1024--1041},
   year = 1997 
   }
   

1. Patrick R. Amestoy, Iain S. Duff, and Jean-Yves L'Excellent. A distributed memory multifrontal solver. In PARASOL Workshop on Sparse matrix solution on distributed architectures, CERFACS, Toulouse, France, September 1997.
   

   @InProceedings{ InProceedingsAmestoy.ADL_97,
   author = {Patrick R. Amestoy and Iain S. Duff and Jean-Yves L'Excellent},
   title = {A distributed memory multifrontal solver},
   booktitle = {{PARASOL} Workshop on Sparse matrix solution on distributed architectures},
   address = {{CERFACS}, Toulouse, France},
   month = sep,
   year = {1997} 
   }
   




2. Pierre-Yves Calland, Jack Dongarra, and Yves Robert. Tiling With Limited Resources. In L. Thiele, J. Fortes, K. Vissers, V. Taylor, T. Noll, and J. Teich, editors, Application Specific Systems, Architectures and Processors, pages 229-238, 1997. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsCalland.CDR_97,
   author = {Pierre-Yves Calland and Jack Dongarra and Yves Robert},
   booktitle = {Application Specific Systems, Architectures and Processors},
   publisher = {IEEE Computer Society Press},
   editor = {L. Thiele and J. Fortes and K. Vissers and V. Taylor and T. Noll and J. Teich},
   pages = {229-238},
   title = {Tiling With Limited Resources},
   year = {1997} 
   }
   




3. Pierre-Yves Calland, Anne Mignotte, Olivier Peyran, Yves Robert, and Frédéric Vivien. Retiming DAGs. In IEEE/ACM Int. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems TAU'97, pages 123-128, 1997. University of Texas at Austin.
   

   @InProceedings{ InProceedingsCalland.CMPRV_97,
   author = {Pierre-Yves Calland and Anne Mignotte and Olivier Peyran and Yves Robert and Fr\'ed\'eric Vivien},
   booktitle = {IEEE/ACM Int. Workshop on Timing Issues in the Specification and Synthesis of Digital Systems {TAU'97}},
   title = {Retiming DAGs},
   publisher = {University of Texas at Austin},
   pages = {123-128},
   year = {1997} 
   }
   




4. Michel J. Daydé, Jérôme P. Décamps, Jean-Yves L'Excellent, and Nicholas I. M. Gould. Solution of Large Scale Partially Separable Unconstrained Optimization Problems Using Element-by-Element Preconditioners. In Proceedings of NAFEMS World Congress 97, volume 2, Stuttgart, pages 942--953, 1997.
   

   @InProceedings{ InProceedingsDayde.DDLG_97,
   author = {Michel J. Dayd\'e and J\'er\^ome P. D\'ecamps and Jean-Yves L'Excellent and Nicholas I. M. Gould},
   title = {Solution of Large Scale Partially Separable Unconstrained Optimization Problems Using Element-by-Element Preconditioners},
   booktitle = {Proceedings of NAFEMS World Congress 97},
   volume = {2},
   pages = {942--953},
   address = {Stuttgart},
   year = 1997 
   }
   




5. Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, and Yves Robert. Block-cyclic array redistribution on networks of workstations. In M. Bubak, J. Dongarra, and J. Wasniewski, editors, Recent Advances in Parallel Virtual Machine and Message Passing Interface, LNCS 1332, pages 343-350, 1997. Springer Verlag.
   

   @InProceedings{ InProceedingsDesprez.DDPRR_97*1,
   author = {Fr\'ed\'eric Desprez and Jack Dongarra and Antoine Petitet and Cyril Randriamaro and Yves Robert},
   booktitle = {Recent Advances in Parallel Virtual Machine and Message Passing Interface},
   editor = {M. Bubak and J. Dongarra and J. Wasniewski},
   pages = {343-350},
   publisher = {Springer Verlag},
   series = {LNCS 1332},
   title = {Block-cyclic array redistribution on networks of workstations},
   year = {1997} 
   }
   




6. Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, and Yves Robert. Scheduling block-cyclic array redistribution. In Parallel Computing'97, 1997. North Holland.
   

   @InProceedings{ InProceedingsDesprez.DDPRR_97,
   author = {Fr\'ed\'eric Desprez and Jack Dongarra and Antoine Petitet and Cyril Randriamaro and Yves Robert},
   booktitle = {Parallel Computing'97},
   publisher = {North Holland},
   title = {Scheduling block-cyclic array redistribution},
   year = {1997} 
   }
   




7. Frédéric Desprez, Jack Dongarra, Fabrice Rastello, and Yves Robert. Determining the idle time of a tiling: new results. In Parallel Architectures and Compilation Techniques PACT'97, pages 307-317, 1997. IEEE Computer Society Press.
   

   @InProceedings{ InProceedingsDesprez.DDRR_97,
   author = {Fr\'ed\'eric Desprez and Jack Dongarra and Fabrice Rastello and Yves Robert},
   booktitle = {Parallel Architectures and Compilation Techniques {PACT'97}},
   publisher = {IEEE Computer Society Press},
   title = {Determining the idle time of a tiling: new results},
   pages = {307-317},
   year = {1997} 
   }
   




8. Serge Miguet, Jean-Marc Nicod, and David Sarrut. A linear algorithm for constructing the Polygon Adjacency Relation in a iso-surface of 3D images. In Christophe Fiorio Ehoud Ahronovitz, editor, Discrete Geometry for Computer Imagery 97, volume 1347 of LNCS, pages 125--136, December 1997. Springer Verlag.
   

   @InProceedings{ InProceedingsMiguet.MNS_97,
   author = {Miguet, Serge and Nicod, Jean-Marc and Sarrut, David},
   title = {A linear algorithm for constructing the Polygon Adjacency Relation in a iso-surface of {3D} images},
   editor = {Ehoud Ahronovitz, Christophe Fiorio},
   booktitle = {Discrete Geometry for Computer Imagery 97},
   series = {LNCS},
   volume = 1347,
   pages = {125--136},
   publisher = {Springer Verlag},
   month = dec,
   year = 1997 
   }
   

1. Pierre Boulet, Alain Darte, Georges-André Silber, and Frédéric Vivien. Loop parallelization algorithms: from parallelism extraction to code generation. Research report 97--17, Laboratoire de l'informatique de parallélisme (LIP), École normale supérieure de Lyon, France, June 1997.
   Note: Rlftp://ftp.lip.ens-lyon.fr/pub/LIP/Rapports/RR/RR97/RR97-17.ps.Z.
   

   @TechReport{ TechReportRR-Laboratoire-97--17,
   author = "Pierre Boulet and Alain Darte and Georges-Andr\'e Silber and Fr\'ed\'eric Vivien",
   address = "\'Ecole normale sup\'erieure de Lyon, France",
   institution = "Laboratoire de l'informatique de parall\'elisme (LIP)",
   month = jun,
   number = "97--17",
   title = "Loop parallelization algorithms: from parallelism extraction to code generation",
   year = 1997,
   type = {Research report},
   note = "\url{ftp://ftp.lip.ens-lyon.fr/pub/LIP/Rapports/RR/RR97/RR97-17.ps.Z}" 
   }
   




2. Eddy Caron and Dominique Lazure. Towards a sparse dedicated programming environment : an analyses of several data-compression formats. Research report 97-21, Laboratoire de Recherche en Informatique d'Amiens, 1997.
   Keywords: Creux.
   

   @TechReport{ TechReportRR-Laboratoire-97-21,
   author = {Caron, Eddy and Lazure, Dominique},
   institution = {Laboratoire de Recherche en Informatique d'Amiens},
   keywords = {Creux},
   number = {97-21},
   title = {Towards a sparse dedicated programming environment : an analyses of several data-compression formats},
   type = {Research report},
   year = 1997 
   }
   




3. Eddy Caron, Dominique Lazure, and Gil Utard. Towards a sparse dedicated programming environment : an analyses of several data-compression formats. Research report 97-25, Laboratoire de Recherche en Informatique d'Amiens, December 1997.
   Note: Revised version of Technical Report LaRIA 97-21.
   Keywords: Creux.
   

   @TechReport{ TechReportRR-Laboratoire-97-25,
   author = {Caron, Eddy and Lazure, Dominique and Utard, Gil},
   institution = {Laboratoire de Recherche en Informatique d'Amiens},
   keywords = {Creux},
   month = dec,
   note = {Revised version of Technical Report {L}a{RIA} 97-21},
   number = {97-25},
   title = {Towards a sparse dedicated programming environment : an analyses of several data-compression formats},
   type = {Research report},
   year = 1997 
   }
   

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