1. Christophe Guillon, Fabrice Rastello, Thierry Bidault, and Florent Bouchez. Procedure placement using temporal-ordering information: dealing with code size expansion. Journal of Embedded Computing, 1(4):437-459 , 2005. Keyword(s): cache optimization, NP-completeness, Instruction cache, code placement, code size, cache miss, min-matching, hamiltonian-path, profiling. [bibtex-entry]



2. Olivier Beaumont, Vincent Boudet, Fabrice Rastello, and Yves Robert. Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica, 34 :217-239, 2002. Keyword(s): heterogeneous resources, load-balancing, communication cost, parallel computing, partitioning, NP-completeness, geometric problems, data allocation. [bibtex-entry]



3. Olivier Beaumont, Arnaud Legrand, Fabrice Rastello, and Yves Robert. Static LU decomposition on heterogeneous platforms. Int. Journal of High Performance Computing Applications, 15(3):310-323, 2001 . Keyword(s): heterogeneous resources, load-balancing, communication cost, parallel computing, partitioning, NP-completeness, geometric problems, data allocation. [bibtex-entry]

1. Benoit Boissinot, Alain Darte, Benoît Dupont de Dinechin, Christophe Guillon, and Fabrice Rastello. Revisiting Out-of-SSA Translation for Correctness, Code Quality, and Efficiency. In International Symposium on Code Generation and Optimization (CGO'09), pages 114--125, March 2009. IEEE Computer Society Press. Note: Best paper award. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, K-COLORABILITY, machine code level, Just-In-Time, register allocation. [bibtex-entry]



2. Florent Bouchez, Alain Darte, and Fabrice Rastello. Advanced Conservative and Optimistic Register Coalescing. In International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES'08), Atlanta, GA, USA, pages 147--156, 2008. ACM Press. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, K-COLORABILITY, register allocation. [bibtex-entry]



3. Florent Bouchez, Alain Darte, and and Fabrice Rastello. On the Complexity of Register Coalescing. In International Symposium on Code Generation and Optimization (CGO'07), pages 102--114, March 2007. IEEE Computer Society Press. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, K-COLORABILITY, register allocation. [bibtex-entry]



4. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the complexity of spill everywhere under SSA form. In ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), pages 103--112, June 2007. ACM Press. Keyword(s): Static Single Assignment, Spilling, NP-completeness, K-COLORABILITY, register allocation. [bibtex-entry]



5. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove?. In International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), November 2006. Springer Verlag. Keyword(s): Static Single Assignment, Coalescing, Spilling, NP-completeness, K-COLORABILITY, register allocation . [bibtex-entry]



6. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation: What does the NP-completeness Proof of Chaitin et al. Really Prove?. In Workshop on Duplicating, Deconstructing and Debunking (WDDD'06), held in conjunction with the International Symposium on Computer Architecture (ISCA'33), July 2006. Keyword(s): Static Single Assignment, Coalescing, Spilling, NP-completeness, K-COLORABILITY, register allocation . [bibtex-entry]



7. Christophe Guillon, Fabrice Rastello, Thierry Bidault, and Florent Bouchez. Procedure Placement using Temporal-Ordering Information: Dealing with Code Size Expansion. In International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES'04), pages 268--27, April 2004. ACM Press. Keyword(s): NP-completeness, Procedure Placement, cache optimization, alignment, Instruction Cache, Hamiltonian Path. [bibtex-entry]



8. Fabrice Rastello, Francois de Ferrière, and Christophe Guillon. Optimizing Translation Out of SSA using Renaming Constraints. In International Symposium on Code Generation and Optimization (CGO'04), pages 265--276, March 2004. IEEE Computer Society Press. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, K-COLORABILITY, machine code level, register allocation. [bibtex-entry]



9. Olivier Beaumont, Vincent Boudet, Arnaud Legrand, Fabrice Rastello, and Yves Robert. Heterogeneous Matrix-Matrix Multiplication, or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. In EuroMicro Workshop on Parallel and Distributed Computing (EuroMicro'2001), pages 298-305, 2001 . IEEE Computer Society Press. Keyword(s): heterogeneous resources, load-balancing, communication cost, parallel computing, partitioning, NP-completeness, geometric problems, numerical libraries, data allocation. [bibtex-entry]

1. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the Complexity of Spill Everywhere under SSA Form. Technical report RR2007-42, LIP, ENS-Lyon, France, March 2007 . Keyword(s): Static Single Assignment, Spilling, NP-completeness, chordal graph, (greedy)-k-colorable-graph, register allocation. [bibtex-entry]



2. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the Complexity of Register Coalescing. Technical report RR2006-15, LIP, ENS-Lyon, France, march 2006. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, chordal graph, (greedy)-k-colorable-graph, register allocation. [bibtex-entry]



3. Florent Bouchez, Alain Darte, and Fabrice Rastello. Register Allocation: What does Chaitin's NP-Completeness Proof really Prove?. Technical report RR2006-13, LIP, ENS-Lyon, France, march 2006. Keyword(s): Static Single Assignment, Coalescing, Spilling, NP-completeness, K-COLORABILITY, register allocation. [bibtex-entry]



4. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register allocation and spill complexity under SSA. Technical report RR2005-33, LIP, ENS Lyon, France, August 2005. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, Compilation, register allocation, Spill, perfect-graphs. [bibtex-entry]



5. Fabrice Rastello, Francois de Ferrière, and Christophe Guillon. Optimizing the translation out-of-SSA with renaming constraints. Technical report RR2005-34, LIP, ENS Lyon, France, august 2005. Keyword(s): Static Single Assignment, Coalescing, NP-completeness, K-COLORABILITY, machine code level, register allocation. [bibtex-entry]



6. Thierry Bidault, Christophe Guillon, Florent Bouchez, and Fabrice Rastello. Procedure placement using temporal-ordering information: dealing with code size expansion. Technical report RR-04-16, LIP, ENS Lyon, France, april 2004. Keyword(s): NP-completeness, INDEPENDENT-SET, instruction cache, code placement, code size, cache miss, min-matching, hamiltonian-path, profiling. [bibtex-entry]



7. Fabrice Rastello, Francois de Ferrière, and Christophe Guillon. Optimizing the translation out-of-SSA with renaming constraints. Technical report RR-03-35, LIP, ENS Lyon, France, june 2003. Note: Available at www.ens-lyon.fr/LIP/. . Keyword(s): Static Single Assignment, Coalescing, NP-completeness, K-COLORABILITY, machine code level, register allocation. [bibtex-entry]



8. Olivier Beaumont, Vincent Boudet, Fabrice Rastello, and Yves Robert. Partitioning a Square into Rectangles: NP-completeness and Approximation Algorithms. Technical report RR-00-10, LIP, ENS Lyon, France, february 2000. Keyword(s): heterogeneous resources, load-balancing, communication cost, parallel computing, partitioning, NP-completeness, geometric problems, data allocation. [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