This paper studies the impact of L2 cache sharing on threads that simultaneously share the
cache, on a chip multi-processor (CMP) architecture. Cache sharing impacts threads …

This dissertation presents an automated system to generate highly efficient, platform-
adapted implementations of sparse matrix kernels. We show that conventional …

Cycle-accurate simulation is far too slow for modeling the expected performance of full
parallel applications on large HPC systems. And just running an application on a system …

Compiler transformations can significantly improve data locality for many scientific programs.
In this paper, we show iterative solvers for partial differential equations (PDEs) in three …

Low power and/or energy consumption is a requirement not only in embedded systems that
run on batteries or have limited cooling capabilities, but also in desktop and mainframes …

The widening memory gap reduces performance of applications with poor data locality.
Therefore, there is a need for methods to analyze data locality and help application …

Loop tiling and unrolling are two important program transformations to exploit locality and
expose instruction level parallelism, respectively. In this paper, we address the problem of …

One of the main obstacles to the efficient solution of scientific problems is the problem of
tuning software, both to the available architecture and to the user problem at hand. We …

Many compiler optimization techniques depend on the ability to calculate the number of
elements that satisfy certain conditions. If these conditions can be represented by linear …

On modern computer systems, the memory performance of an application depends on its
locality. For a single execution, locality-correlated measures like average miss rate or …