26 citations · 26 across the 3 of their papers we have counts for
6 papers
Performance Debugging through Microarchitectural Sensitivity and Causality Analysis
Alban Dutilleul, Hugo Pompougnac, Nicolas Derumigny +4
Modern Out-of-Order (OoO) CPUs are complex systems with many components interleaved in non-trivial ways. Pinpointing performance bottlenecks and understanding the underlying causes…
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
Lionel Eyraud-Dubois, Guillaume Iooss, Julien Langou +1
When designing an algorithm, one cares about arithmetic/computational complexity, but data movement (I/O) complexity plays an increasingly important role that highly impacts perfor…
CesASMe and Staticdeps: static detection of memory-carried dependencies for code analyzers
Théophile Bastian, Hugo Pompougnac, Alban Dutilleul +1
A variety of code analyzers, such as IACA, uiCA, llvm-mca or Ithemal, strive to statically predict the throughput of a computation kernel. Each analyzer is based on its own simplif…
On Characterizing the Data Access Complexity of Programs
Venmugil Elango, Fabrice Rastello, Louis-Noel Pouchet +2
Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no l…
A Tiling Perspective for Register Optimization
Lukasz Domagala, Fabrice Rastello, Sadayappan Ponnuswany +1
Register allocation is a much studied problem. A particularly important context for optimizing register allocation is within loops, since a significant fraction of the execution ti…
Parameterized Construction of Program Representations for Sparse Dataflow Analyses
André Tavares, Benoit Boissinot, Fernando Pereira +1
Data-flow analyses usually associate information with control flow regions. Informally, if these regions are too small, like a point between two consecutive statements, we call the…