The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations

Authors:
Christoph W. Kessler;Craig H. Smith
Affiliations:
-;-
Venue:
IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
Year:
1999

Citing 0
Cited 7

Efficient Representation Scheme for Multidimensional Array Operations

IEEE Transactions on Computers
Efficient Data Parallel Algorithms for Multidimensional Array Operations Based on the EKMR Scheme for Distributed Memory Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Efficient Data Compression Methods for Multidimensional Sparse Array Operations Based on the EKMR Scheme

IEEE Transactions on Computers
Support and optimization for parallel sparse programs with array intrinsics of Fortran 90

Parallel Computing
Efficient Data Distribution Schemes for EKMR-Based Sparse Arrays on Distributed Memory Multicomputers

The Journal of Supercomputing
Data distribution schemes of sparse arrays on distributed memory multicomputers

The Journal of Supercomputing
XARK: An extensible framework for automatic recognition of computational kernels

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in the code. In this paper we describe SPARAMAT, a system for speculative automatic program comprehension suitable for sparse matrix codes, and its implementation.