Sciweavers

19 search results - page 1 / 4
» Aspect-Oriented Programming of Sparse Matrix Code
Sort
View
ISCOPE
1997
Springer
13 years 9 months ago
Aspect-Oriented Programming of Sparse Matrix Code
John Irwin, Jean-Marc Loingtier, John R. Gilbert, ...
IWPC
1999
IEEE
13 years 9 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
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 th...
Christoph W. Keßler, Craig Smith
AOSD
2007
ACM
13 years 8 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
EUROPAR
1997
Springer
13 years 9 months ago
A Relational Approach to the Compilation of Sparse Matrix Programs
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
ICS
1997
Tsinghua U.
13 years 9 months ago
Sparse Code Generation for Imperfectly Nested Loops with Dependences
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
Vladimir Kotlyar, Keshav Pingali