The automatic generation of sparse primitives

Autor:	Harry A. G. Wijshoff, Aart J. C. Bik, Peter J. H. Brinkhaus, Peter M. W. Knijnenburg
Rok vydání:	1998
Předmět:	Class (computer programming) K-SVD Theoretical computer science Computer science Applied Mathematics Parallel computing Sparse approximation computer.software_genre Sparse array Mathematical software Code (cryptography) Compiler computer Software Sparse matrix
Zdroj:	ACM Transactions on Mathematical Software. 24:190-225
ISSN:	1557-7295 0098-3500
DOI:	10.1145/290200.287636
Popis:	Primitives in mathematical software are usually written and optimized by hand. With the implementation of a “sparse compiler” that is capable of automatically converting a dense program into sparse code, however, a completely different approach to the generation of sparse primitives can be taken. A dense implementation of a particular primitive is supplied to the sparse compiler, after which it can be converted into many different sparse versions of this primitive. Each version is specifically tailored to a class of sparse matrices having a specific nonzero structure. In this article, we discuss some of our experiences with this new approach.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::b32300713555b24ee5bb3558dcaf0b15 https://doi.org/10.1145/290200.287636 Zobrazit plný text záznamu