31 citations · 71 across the 7 of their papers we have counts for
9 papers
Is Sparse Matrix Reordering Effective for Sparse Matrix-Vector Multiplication?
Omid Asudeh, Sina Mahdipour Saravani, Gerald Sabin +2
This work evaluates the impact of sparse matrix reordering on the performance of sparse matrix-vector multiplication across different multicore CPU platforms. Reordering can signif…
PALMED: Throughput Characterization for Superscalar Architectures -- Extended Version
Nicolas Derumigny, Fabian Gruber, Théophile Bastian +4
In a super-scalar architecture, the scheduler dynamically assigns micro-operations (OPs) to execution ports. The port mapping of an architecture describes how an instruction dec…
Automated Derivation of Parametric Data Movement Lower Bounds for Affine Programs
Auguste Olivry, Julien Langou, Louis-Noël Pouchet +2
For most relevant computation, the energy and time needed for data movement dominates that for performing arithmetic operations on all computing systems today. Hence it is of criti…
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…
On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution
Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet +2
Technology trends are making the cost of data movement increasingly dominant, both in terms of energy and time, over the cost of performing arithmetic operations in computer system…
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…
Beyond Reuse Distance Analysis: Dynamic Analysis for Characterization of Data Locality Potential
Naznin Fauzia, Venmugil Elango, Mahesh Ravishankar +5
Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak processing rate to memory bandwidth) as highlighted by recent studies on Exascale archi…
On the Complexity of Spill Everywhere under SSA Form
Florent Bouchez, Alain Darte, Fabrice Rastello
Compilation for embedded processors can be either aggressive (time consuming cross-compilation) or just in time (embedded and usually dynamic). The heuristics used in dynamic compi…