default search action
Fabrice Rastello
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c59]Théo Barollet, Christophe Guillon, Manuel Selva, François Broquedis, Florent Bouchez-Tichadou, Fabrice Rastello:
EasyTracker: A Python Library for Controlling and Inspecting Program Execution. CGO 2024: 359-372 - [c58]Lionel Eyraud-Dubois
, Guillaume Iooss
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern. SPAA 2024: 183-193 - [i11]Théophile Bastian, Hugo Pompougnac, Alban Dutilleul, Fabrice Rastello:
CesASMe and Staticdeps: static detection of memory-carried dependencies for code analyzers. CoRR abs/2402.14567 (2024) - [i10]Hugo Pompougnac, Alban Dutilleul, Christophe Guillon, Nicolas Derumigny, Fabrice Rastello:
Performance bottlenecks detection through microarchitectural sensitivity. CoRR abs/2402.15773 (2024) - [i9]Lionel Eyraud-Dubois, Guillaume Iooss, Julien Langou, Fabrice Rastello:
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern. CoRR abs/2404.16443 (2024) - 2023
- [j17]Nicolas Tollenaere
Autotuning Convolutions Is Easier Than You Think. ACM Trans. Archit. Code Optim. 20(2): 20:1-20:24 (2023) - 2022
- [c57]Nicolas Derumigny, Théophile Bastian, Fabian Gruber, Guillaume Iooss, Christophe Guillon, Louis-Noël Pouchet, Fabrice Rastello:
PALMED: Throughput Characterization for Superscalar Architectures. CGO 2022: 106-117 - [p9]Philip Brisk, Fabrice Rastello:
Properties and Flavours. SSA-based Compiler Design 2022: 13-22 - [p8]Jeremy Singer, Fabrice Rastello:
Standard Construction and Destruction Algorithms. SSA-based Compiler Design 2022: 23-39 - [p7]Markus Schordan, Fabrice Rastello:
Introduction. SSA-based Compiler Design 2022: 91-93 - [p6]Benoit Boissinot, Fabrice Rastello:
Liveness. SSA-based Compiler Design 2022: 107-122 - [p5]Vivek Sarkar, Fabrice Rastello:
Introduction. SSA-based Compiler Design 2022: 157-163 - [p4]Fernando Magno Quintão Pereira, Fabrice Rastello:
Static Single Information Form. SSA-based Compiler Design 2022: 165-184 - [p3]James Stanier, Fabrice Rastello:
Graphs and Gating Functions. SSA-based Compiler Design 2022: 185-199 - [p2]Fabrice Rastello:
SSA Destruction for Machine Code. SSA-based Compiler Design 2022: 285-302 - [p1]Florent Bouchez-Tichadou, Fabrice Rastello:
Register Allocation. SSA-based Compiler Design 2022: 303-328 - [e2]Fabrice Rastello, Florent Bouchez-Tichadou:
SSA-based Compiler Design. Springer 2022, ISBN 978-3-030-80514-2 [contents] - 2021
- [c56]Miguel Á. Abella-González, Pedro Carollo-Fernández, Louis-Noël Pouchet, Fabrice Rastello, Gabriel Rodríguez
PolyBench/Python: benchmarking Python environments with polyhedral optimizations. CC 2021: 59-70 - [c55]Théo Barollet, Florent Bouchez-Tichadou, Fabrice Rastello:
Do Common Educational Datasets contain Static Information? A Statistical Study. EDM 2021 - [c54]Auguste Olivry, Guillaume Iooss, Nicolas Tollenaere, Atanas Rountev, P. Sadayappan, Fabrice Rastello:
IOOpt: automatic derivation of I/O complexity bounds for affine programs. PLDI 2021: 1187-1202 - 2020
- [j16]Manuel Selva
Building a Polyhedral Representation from an Instrumented Execution: Making Dynamic Analyses of Nonaffine Programs Scalable. ACM Trans. Archit. Code Optim. 16(4): 45:1-45:26 (2020) - [c53]Auguste Olivry, Julien Langou
Automated derivation of parametric data movement lower bounds for affine programs. PLDI 2020: 808-822 - [c52]Süreyya Emre Kurt, Aravind Sukumaran-Rajam, Fabrice Rastello, P. Sadayappan:
Efficient tiled sparse matrix multiplication through matrix signatures. SC 2020: 87 - [i8]Nicolas Derumigny, Fabian Gruber, Théophile Bastian, Christophe Guillon, Louis-Noël Pouchet, Fabrice Rastello:
From micro-OPs to abstract resources: constructing a simpler CPU performance model through microbenchmarking. CoRR abs/2012.11473 (2020)
2010 – 2019
- 2019
- [c51]Fabian Gruber, Manuel Selva, Diogo Sampaio, Christophe Guillon, Antoine Moynault, Louis-Noël Pouchet, Fabrice Rastello:
Data-flow/dependence profiling for structured transformations. PPoPP 2019: 173-185 - [c50]Rui Li
Analytical cache modeling and tilesize optimization for tensor contractions. SC 2019: 74:1-74:13 - [i7]Auguste Olivry, Julien Langou, Louis-Noël Pouchet, P. Sadayappan, Fabrice Rastello:
Automated Derivation of Parametric Data Movement Lower Bounds for Affine Programs. CoRR abs/1911.06664 (2019) - 2018
- [c49]Changwan Hong, Aravind Sukumaran-Rajam
GPU code optimization using abstract kernel emulation and sensitivity analysis. PLDI 2018: 736-751 - [c48]Prashant Singh Rawat, Fabrice Rastello, Aravind Sukumaran-Rajam
Register optimizations for stencils on GPUs. PPoPP 2018: 168-182 - [c47]Changwan Hong, Aravind Sukumaran-Rajam
Performance modeling for GPUs using abstract kernel emulation. PPoPP 2018: 397-398 - [c46]Prashant Singh Rawat, Aravind Sukumaran-Rajam, Atanas Rountev, Fabrice Rastello, Louis-Noël Pouchet, P. Sadayappan:
Associative instruction reordering to alleviate register pressure. SC 2018: 46:1-46:13 - 2017
- [c45]Prashant Singh Rawat, Aravind Sukumaran-Rajam
POSTER: Statement Reordering to Alleviate Register Pressure for Stencils on GPUs. PACT 2017: 158-159 - [c44]Diogo Nunes Sampaio, Louis-Noël Pouchet, Fabrice Rastello:
Simplification and runtime resolution of data dependence constraints for loop transformations. ICS 2017: 10:1-10:11 - [c43]Samyam Rajbhandari, Fabrice Rastello, Karol Kowalski, Sriram Krishnamoorthy
Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis. PPoPP 2017: 327-340 - 2016
- [j15]Wenlei Bao, Changwan Hong, Sudheer Chunduri
Static and Dynamic Frequency Scaling on Multicore CPUs. ACM Trans. Archit. Code Optim. 13(4): 51:1-51:26 (2016) - [c42]Diogo Nunes Sampaio, Alain Ketterlin, Louis-Noël Pouchet, Fabrice Rastello:
POSTER: Hybrid Data Dependence Analysis for Loop Transformations. PACT 2016: 439-440 - [c41]Lukasz Domagala, Duco van Amstel, Fabrice Rastello, P. Sadayappan:
Register allocation and promotion through combined instruction scheduling and loop unrolling. CC 2016: 143-151 - [c40]Samyam Rajbhandari, Jinsung Kim
On fusing recursive traversals of K-d trees. CC 2016: 152-162 - [c39]Philippe Virouleau, François Broquedis
Using Data Dependencies to Improve Task-Based Scheduling Strategies on NUMA Architectures. Euro-Par 2016: 531-544 - [c38]François Gindraud, Fabrice Rastello, Albert Cohen, François Broquedis
A bounded memory allocator for software-defined global address spaces. ISMM 2016: 78-88 - [c37]Philippe Virouleau, Adrien Roussel
Description, Implementation and Evaluation of an Affinity Clause for Task Directives. IWOMP 2016: 61-73 - [c36]Lukasz Domagala, Duco van Amstel, Fabrice Rastello:
Generalized cache tiling for dataflow programs. LCTES 2016: 52-61 - [c35]Changwan Hong, Wenlei Bao, Albert Cohen, Sriram Krishnamoorthy, Louis-Noël Pouchet, Fabrice Rastello, J. Ramanujam
Effective padding of multidimensional arrays to avoid cache conflict misses. PLDI 2016: 129-144 - [c34]Wenlei Bao, Sriram Krishnamoorthy
PolyCheck: dynamic verification of iteration space transformations on affine programs. POPL 2016: 539-554 - [c33]François Gindraud, Fabrice Rastello, Albert Cohen, François Broquedis
An interval constrained memory allocator for the Givy GAS runtime. PPoPP 2016: 31:1-31:2 - [c32]Samyam Rajbhandari, Jinsung Kim, Sriram Krishnamoorthy, Louis-Noël Pouchet, Fabrice Rastello, Robert J. Harrison
A domain-specific compiler for a parallel multiresolution adaptive numerical simulation environment. SC 2016: 468-479 - [c31]Timothy Carpenter, Fabrice Rastello, P. Sadayappan, Anastasios Sidiropoulos:
Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. SPAA 2016: 161-163 - [e1]Björn Franke, Youfeng Wu, Fabrice Rastello:
Proceedings of the 2016 International Symposium on Code Generation and Optimization, CGO 2016, Barcelona, Spain, March 12-18, 2016. ACM 2016, ISBN 978-1-4503-3778-6 [contents] - 2015
- [c30]Péricles Alves, Fabian Gruber, Johannes Doerfert
Runtime pointer disambiguation. OOPSLA 2015: 589-606 - [c29]Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam
On Characterizing the Data Access Complexity of Programs. POPL 2015: 567-580 - 2014
- [j14]Venmugil Elango, Naser Sedaghati, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam
On Using the Roofline Model with Lower Bounds on Data Movement. ACM Trans. Archit. Code Optim. 11(4): 67:1-67:23 (2014) - [c28]André Luiz Camargos Tavares, Benoit Boissinot, Fernando Magno Quintão Pereira, Fabrice Rastello:
Parameterized Construction of Program Representations for Sparse Dataflow Analyses. CC 2014: 18-39 - [c27]Kevin Stock, Martin Kong
A framework for enhancing data reuse via associative reordering. PLDI 2014: 65-76 - [c26]Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam
On characterizing the data movement complexity of computational DAGs for parallel execution. SPAA 2014: 296-306 - [i6]Naznin Fauzia, Venmugil Elango, Mahesh Ravishankar, J. Ramanujam, Fabrice Rastello, Atanas Rountev, Louis-Noël Pouchet, P. Sadayappan:
Beyond Reuse Distance Analysis: Dynamic Analysis for Characterization of Data Locality Potential. CoRR abs/1401.5024 (2014) - [i5]André Luiz Camargos Tavares, Benoit Boissinot, Fernando Magno Quintão Pereira, Fabrice Rastello:
Parameterized Construction of Program Representations for Sparse Dataflow Analyses. CoRR abs/1403.5952 (2014) - [i4]Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam, P. Sadayappan:
On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution. CoRR abs/1404.4767 (2014) - [i3]Lukasz Domagala, Fabrice Rastello, P. Sadayappan, Duco van Amstel:
A Tiling Perspective for Register Optimization. CoRR abs/1406.0582 (2014) - [i2]Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, J. Ramanujam, P. Sadayappan:
On Characterizing the Data Access Complexity of Programs. CoRR abs/1411.2286 (2014) - 2013
- [j13]Naznin Fauzia, Venmugil Elango, Mahesh Ravishankar, J. Ramanujam
Beyond reuse distance analysis: Dynamic analysis for characterization of data locality potential. ACM Trans. Archit. Code Optim. 10(4): 53:1-53:29 (2013) - [c25]Boubacar Diouf, Albert Cohen, Fabrice Rastello:
A polynomial spilling heuristic: Layered allocation. CGO 2013: 10:1-10:10 - 2012
- [j12]Benoit Boissinot, Philip Brisk
SSI Properties Revisited. ACM Trans. Embed. Comput. Syst. 11(S1): 21 (2012) - 2011
- [c24]Benoit Boissinot, Florian Brandner
A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs. APLAS 2011: 137-154 - [c23]Quentin Colombet, Benoit Boissinot, Philip Brisk
Graph-coloring and treescan register allocation using repairing. CASES 2011: 45-54 - [c22]André Luiz Camargos Tavares, Quentin Colombet, Mariza Andrade da Silva Bigonha, Christophe Guillon, Fernando Magno Quintão Pereira, Fabrice Rastello:
Decoupled graph-coloring register allocation with hierarchical aliasing. SCOPES 2011: 1-10 - 2010
- [c21]Boubacar Diouf, Albert Cohen, Fabrice Rastello, John Cavazos:
Split Register Allocation: Linear Complexity Without the Performance Penalty. HiPEAC 2010: 66-80 - [c20]Florent Bouchez, Quentin Colombet, Alain Darte, Fabrice Rastello, Christophe Guillon:
Parallel copy motion. SCOPES 2010: 1
2000 – 2009
- 2009
- [c19]Benoit Boissinot, Alain Darte, Fabrice Rastello, Benoît Dupont de Dinechin, Christophe Guillon:
Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency. CGO 2009: 114-125 - 2008
- [c18]Florent Bouchez, Alain Darte, Fabrice Rastello:
Advanced conservative and optimistic register coalescing. CASES 2008: 147-156 - [c17]Benoit Boissinot, Sebastian Hack, Daniel Grund, Benoît Dupont de Dinechin, Fabrice Rastello:
Fast liveness checking for ssa-form programs. CGO 2008: 35-44 - 2007
- [c16]Florent Bouchez, Alain Darte, Fabrice Rastello:
On the Complexity of Register Coalescing. CGO 2007: 102-114 - [c15]Florent Bouchez, Alain Darte, Fabrice Rastello:
On the complexity of spill everywhere under SSA form. LCTES 2007: 103-112 - [i1]Florent Bouchez, Alain Darte, Fabrice Rastello:
On the Complexity of Spill Everywhere under SSA Form. CoRR abs/0710.3642 (2007) - 2006
- [c14]Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello:
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. LCPC 2006: 283-298 - 2005
- [j11]Christophe Guillon, Fabrice Rastello, Thierry Bidault, Florent Bouchez:
Procedure placement using temporal-ordering information: Dealing with code size expansion. J. Embed. Comput. 1(4): 437-459 (2005) - 2004
- [c13]Christophe Guillon, Fabrice Rastello, Thierry Bidault, Florent Bouchez:
Procedure placement using temporal-ordering information: dealing with code size expansion. CASES 2004: 268-279 - [c12]Fabrice Rastello, François de Ferrière, Christophe Guillon:
Optimizing Translation Out of SSA Using Renaming Constraints. CGO 2004: 265-278 - 2003
- [j10]Fabrice Rastello, Amit Rao, Santosh Pande
Optimal task scheduling at run time to exploit intra-tile parallelism. Parallel Comput. 29(2): 209-239 (2003) - 2002
- [j9]Olivier Beaumont
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. Algorithmica 34(3): 217-239 (2002) - [j8]Olivier Beaumont
Dense linear algebra kernels on heterogeneous platforms: Redistribution issues. Parallel Comput. 28(2): 155-185 (2002) - [j7]Fabrice Rastello, Yves Robert
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles. IEEE Trans. Parallel Distributed Syst. 13(5): 460-470 (2002) - [c11]Fabrice Rastello, Thierry Dauxois
Efficient Tiling for an ODE Discrete Integration Program: Redundant Tasks Instead of Trapezoidal Shaped-Tiles. IPDPS 2002 - 2001
- [j6]Olivier Beaumont
Static LU Decomposition on Heterogeneous Platforms. Int. J. High Perform. Comput. Appl. 15(3): 310-323 (2001) - [j5]Vincent Boudet, Fabrice Rastello, Yves Robert
Alignment and Distribution Is Not (Always) NP-Hard. J. Parallel Distributed Comput. 61(4): 501-519 (2001) - [j4]Olivier Beaumont
A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers). IEEE Trans. Computers 50(10): 1052-1070 (2001) - [j3]Olivier Beaumont
Matrix Multiplication on Heterogeneous Platforms. IEEE Trans. Parallel Distributed Syst. 12(10): 1033-1051 (2001) - [c10]Olivier Beaumont
Heterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. PDP 2001: 298-305 - 2000
- [c9]Olivier Beaumont, Vincent Boudet, Arnaud Legrand, Fabrice Rastello, Yves Robert:
Heterogeneity Considered Harmful to Algorithm Designers. CLUSTER 2000: 403- - [c8]Olivier Beaumont
Matrix-Matrix Multiplication on Heterogeneous Platforms. ICPP 2000: 289-298 - [c7]Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert:
Load Balancing Strategies for Dense Linear Algebra Kernels on Heterogeneous Two-Dimensional Grids. IPDPS 2000: 783-792
1990 – 1999
- 1999
- [j2]Pierre Boulet
Algorithmic Issues on Heterogeneous Computing Platforms. Parallel Process. Lett. 9(2): 197-213 (1999) - [c6]Vincent Boudet, Fabrice Rastello, Yves Robert:
A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers). PDPTA 1999: 709-712 - [c5]Vincent Boudet, Fabrice Rastello, Yves Robert:
Algorithmic Issues for (Distributed) Hetergeneous Computing Platforms. PDPTA 1999: 1285-1291 - [c4]Vincent Boudet, Fabrice Rastello, Yves Robert
PVM Implementation of Heterogeneous ScaLAPACK Dense Linear Solvers. PVM/MPI 1999: 333-340 - 1998
- [j1]Frederic Desprez, Jack J. Dongarra, Fabrice Rastello, Yves Robert:
Determining the Idle Time of a Tiling: New Results. J. Inf. Sci. Eng. 14(1): 167-190 (1998) - [c3]Vincent Boudet, Fabrice Rastello, Yves Robert:
Alignment and Distribution is NOT (Always) NP-Hard. ICPADS 1998: 648-657 - [c2]Fabrice Rastello, Amit Rao, Santosh Pande
Optimal Task Scheduling to Minimize Inter-Tile Latencies. ICPP 1998: 172-179 - 1997
- [c1]Frederic Desprez, Jack J. Dongarra, Fabrice Rastello, Yves Robert:
Determining the Idle Time of Tiling: New Results. IEEE PACT 1997: 307-317
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: