A framework for sparse matrix code synthesis from high-level specifications

Authors:
Nawaaz Ahmed;Nikolay Mateev;Keshav Pingali
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY;Department of Computer Science, Cornell University, Ithaca, NY;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Year:
2000

Citing 13
Cited 8

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Block sparse Cholesky algorithms on advanced uniprocessor computers

SIAM Journal on Scientific Computing
Compilation techniques for sparse matrix computations

ICS '93 Proceedings of the 7th international conference on Supercomputing
Some efficient solutions to the affine scheduling problem: I. One-dimensional time

International Journal of Parallel Programming
Advanced compiler optimizations for sparse computations

Journal of Parallel and Distributed Computing
Next-generation generic programming and its application to sparse matrix computations

Proceedings of the 14th international conference on Supercomputing
Synthesizing transformations for locality enhancement of imperfectly-nested loop nests

Proceedings of the 14th international conference on Supercomputing
Automatic Nonzero Structure Analysis

SIAM Journal on Computing
Generic Programming

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
A Relational Approach to the Compilation of Sparse Matrix Programs

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
The Bernoulli Generic Matrix Library

The Bernoulli Generic Matrix Library
A Supernodal Approach to Sparse Partial Pivoting

A Supernodal Approach to Sparse Partial Pivoting

Landing CG on EARTH: a case study of fine-grained multithreading on an evolutionary path

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Array language support for parallel sparse computation

ICS '01 Proceedings of the 15th international conference on Supercomputing
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests

International Journal of Parallel Programming
Automating the generation of composed linear algebra kernels

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Data representation synthesis

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
POET: a scripting language for applying parameterized source-to-source program transformations

Software—Practice & Experience
An introduction to data representation synthesis

Communications of the ACM
Comparing Different Sparse Matrix Storage Structures as Index Structure for Arabic Text Collection

International Journal of Information Retrieval Research

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present compiler technology for synthesizing sparse matrix code from (i) dense matrix code, and (ii) a description of the index structure of a sparse matrix. Our approach is to embed statement instances into a Cartesian product of statement iteration and data spaces, and to produce efficient sparse code by identifying common enumerations for multiple references to sparse matrices. The approach works for imperfectly-nested codes with dependences, and produces sparse code competitive withhand-written library code for the Basic Linear Algebra Subroutines (BLAS).