Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Compiling Imperfectly-nested Sparse Matrix Codes with Dependences
Authors: Ahmed, Nawaaz
Mateev, Nikolay
Pingali, Keshav
Stodghill, Paul
Keywords: computer science
technical report
Issue Date: 7-Mar-2000
Publisher: Cornell University
Abstract: We present compiler technology for generating sparse matrix code from (i) dense matrix code and (ii) a description of the indexing structure of the sparse matrices. This technology embeds statement instances into a Cartesian product of statement iteration and data spaces, and produces efficient sparse code by identifying common enumerations for multiple references to sparse matrices. This approach works for imperfectly-nested codes with dependences, and produces sparse code competitive with hand-written library code.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
2000-1788.pdf177.6 kBAdobe PDFView/Open
2000-1788.ps211.39 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us