Skip to main content


eCommons@Cornell

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

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7282
Title: A Relational Approach to the Compilation of Sparse Matrix Programs
Authors: Kotlyar, Vladimir
Pingali, Keshav
Stodghill, Paul
Keywords: computer science
technical report
Issue Date: Mar-1997
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR97-1627
Abstract: We present a relational algebra based framework for compiling efficient sparse matrix code from dense DO-ANY loops and a specification of the representation of the sparse matrix. We present experimental data that demonstrates that the code generated by our compiler achieves performance competitive with that of hand-written codes for important computational kernels.
URI: http://hdl.handle.net/1813/7282
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
97-1627.pdf239.35 kBAdobe PDFView/Open
97-1627.ps189.21 kBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us