Show simple item record

dc.contributor.authorAhmed, Nawaazen_US
dc.contributor.authorMateev, Nikolayen_US
dc.contributor.authorPingali, Keshaven_US
dc.contributor.authorStodghill, Paulen_US
dc.date.accessioned2007-04-09T19:47:38Z
dc.date.available2007-04-09T19:47:38Z
dc.date.issued2000-03-07en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2000-1788en_US
dc.identifier.urihttps://hdl.handle.net/1813/5781
dc.description.abstractWe 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.extent181861 bytes
dc.format.extent216459 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleCompiling Imperfectly-nested Sparse Matrix Codes with Dependencesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics