[PDF][PDF] Next-generation generic programming and its application to sparse matrix computations
N Mateev, K Pingali, P Stodghill, V Kotlyar - Proceedings of the 14th …, 2000 - dl.acm.org
N Mateev, K Pingali, P Stodghill, V Kotlyar
Proceedings of the 14th international conference on Supercomputing, 2000•dl.acm.orgThe contributions of this paper are the following. We introduce a new variety of generic
programming in which algorithm implementors use a different API than data structure
designers, the gap between the API's being bridged by restructuring compilers. One view of
this approach is that it exploits restructuring compiler technology to perform a novel kind of
template instantiation. We demonstrate the usefulness of this new generic programming
technology by deploying it in a system that generates efficient sparse codes from high-level …
programming in which algorithm implementors use a different API than data structure
designers, the gap between the API's being bridged by restructuring compilers. One view of
this approach is that it exploits restructuring compiler technology to perform a novel kind of
template instantiation. We demonstrate the usefulness of this new generic programming
technology by deploying it in a system that generates efficient sparse codes from high-level …
The contributions of this paper are the following.
- We introduce a new variety of generic programming in which algorithm implementors use a different API than data structure designers, the gap between the API's being bridged by restructuring compilers. One view of this approach is that it exploits restructuring compiler technology to perform a novel kind of template instantiation.
- We demonstrate the usefulness of this new generic programming technology by deploying it in a system that generates efficient sparse codes from high-level algorithms and specifications of sparse matrix formats.
- We argue that sparse matrix formats should be viewed as indexed-sequential access data structures (in the database sense), and show that appropriate abstractions of the index structure of common formats can be conveyed to a restructuring compiler through the type system of a modern language that supports inheritance and templates.
ACM Digital LibraryShowing the best result for this search. See all results