This report summarizes the progress made as part of a one year lab-directed research and development (LDRD) project to fund the research efforts of Bryan Marker at the University of Texas at Austin. The goal of the project was to develop new techniques for automatically tuning the performance of dense linear algebra kernels. These kernels often represent the majority of computational time in an application. The primary outcome from this work is a demonstration of the value of model driven engineering as an approach to accurately predict and study performance trade-offs for dense linear algebra computations
AbstractThe introduction of auto-tuning techniques in linear algebra routines using hybrid combinati...
Abstract. To implement dense linear algebra algorithms for distributed-memory computers, an expert a...
This paper discusses the scalability of Cholesky, LU, and QR factorization routines on MIMD distribu...
This paper describes an approach for the automatic generation and optimization of numerical softwar...
One of the main obstacles to the efficient solution of scientific problems is the problem of tuning ...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10766-013-0249-6The in...
Abstract. In this article we look at the generation of libraries for dense linear algebra operations...
The complexity of hardware platforms available today is increasing. Com-plex memory hierarchies, mul...
It is rare for a programmer to solve a numerical problem with a single library call; most problems r...
textOver the last two decades, much progress has been made in the area of the high-performance sequ...
Dense linear algebra(DLA) is one of the most seven important kernels in high performance computing. ...
This dissertation introduces measurement-based performance modeling and prediction techniques for de...
Autotuning technology has emerged recently as a systematic pro-cess for evaluating alternative imple...
Abstract—It is well known that the behavior of dense linear algebra algorithms is greatly influenced...
This paper presents an overview of the LAPACK library, a portable, public-domain library to solve th...
AbstractThe introduction of auto-tuning techniques in linear algebra routines using hybrid combinati...
Abstract. To implement dense linear algebra algorithms for distributed-memory computers, an expert a...
This paper discusses the scalability of Cholesky, LU, and QR factorization routines on MIMD distribu...
This paper describes an approach for the automatic generation and optimization of numerical softwar...
One of the main obstacles to the efficient solution of scientific problems is the problem of tuning ...
The final publication is available at Springer via http://dx.doi.org/10.1007/s10766-013-0249-6The in...
Abstract. In this article we look at the generation of libraries for dense linear algebra operations...
The complexity of hardware platforms available today is increasing. Com-plex memory hierarchies, mul...
It is rare for a programmer to solve a numerical problem with a single library call; most problems r...
textOver the last two decades, much progress has been made in the area of the high-performance sequ...
Dense linear algebra(DLA) is one of the most seven important kernels in high performance computing. ...
This dissertation introduces measurement-based performance modeling and prediction techniques for de...
Autotuning technology has emerged recently as a systematic pro-cess for evaluating alternative imple...
Abstract—It is well known that the behavior of dense linear algebra algorithms is greatly influenced...
This paper presents an overview of the LAPACK library, a portable, public-domain library to solve th...
AbstractThe introduction of auto-tuning techniques in linear algebra routines using hybrid combinati...
Abstract. To implement dense linear algebra algorithms for distributed-memory computers, an expert a...
This paper discusses the scalability of Cholesky, LU, and QR factorization routines on MIMD distribu...