Left-Looking to Right-Looking and Vice Versa: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring

Authors:
Nikolay Mateev;Vijay Menon;Keshav Pingali
Affiliations:
-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 7
Cited 0

LAPACK's user's guide

LAPACK's user's guide
Enhancing array dataflow dependence analysis with on-demand global value propagation

ICS '95 Proceedings of the 9th international conference on Supercomputing
ScaLAPACK user's guide

ScaLAPACK user's guide
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests

Proceedings of the 14th international conference on Supercomputing
High Performance Compilers for Parallel Computing

High Performance Compilers for Parallel Computing
Fractal Symbolic Analysis for Program Transformations (*new file*)

Fractal Symbolic Analysis for Program Transformations (*new file*)
Left-looking to Right-looking and vice versa: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring

Left-looking to Right-looking and vice versa: An Application of Fractal Symbolic Analysis to Linear Algebra Code Restructuring

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have recently developed a new program analysis strategy called fractal symbolic analysis that addresses some of limitations of techniques such as dependence analysis. In this paper, we show how fractal symbolic analysis can be used to convert between left-looking and right-looking versions of three kernels of central importance in computational science: Cholesky factorization, LU factorization with pivoting, and triangular solve.