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

We consider performance tuning, by code and data structure reorganization, of sparse
matrix-vector multiply (SpM× V), one of the most important computational kernels in scientific …

We present new performance models and more compact data structures for cache blocking
when applied to sparse matrix-vector multiply (SpM× V). We extend our prior models by …

Automatic Performance Tuning and Analysis of Sparse Triangular Solve Page 1 Automatic
Performance Tuning and Analysis of Sparse Triangular Solve Richard Vuduc, Shoaib Kamil …

We consider the problem of building high-performance implementations of sparse matrix-
vector multiply (SpM× V), or y= y+ A· x, which is an important and ubiquitous computational …

This paper presents uniprocessor performance optimizations, automatic tuning techniques,
and an experimental analysis of the sparse matrix operation, y= AT Ax, where A is a sparse …

This paper presents uniprocessor performance optimizations, automatic tuning techniques,
and an experimental analysis of the sparse matrix operation, y= AT Ax, where A is a sparse …

A variety of building energy analysis and simulation tools are increasingly used to determine
peak heating and cooling loads, size thermal plant, anticipate annual energy consumption …

Building high-performance implementations of sparse matrix-vector multiply (SpM× V), an
important and ubiquitous computational kernel, is fundamentally limited by a variety of …

We consider the problem of building high-performance implementations of sparse matrix-
vector multiply (SpM× V), or y= y+ A· x, which is an important and ubiquitous computational …