Compiling Imperfectly-nested Sparse Matrix Codes with Dependences
dc.contributor.author | Ahmed, Nawaaz | en_US |
dc.contributor.author | Mateev, Nikolay | en_US |
dc.contributor.author | Pingali, Keshav | en_US |
dc.contributor.author | Stodghill, Paul | en_US |
dc.date.accessioned | 2007-04-09T19:47:38Z | |
dc.date.available | 2007-04-09T19:47:38Z | |
dc.date.issued | 2000-03-07 | en_US |
dc.description.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. | en_US |
dc.format.extent | 181861 bytes | |
dc.format.extent | 216459 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2000-1788 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/5781 | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Compiling Imperfectly-nested Sparse Matrix Codes with Dependences | en_US |
dc.type | technical report | en_US |