P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Performance Tuning and Analysis of Sparse .. - Vuduc, Kamil, Hsu, .. (2002) (Correct)
....to account for self and cross interference misses. In this study, we see that on current and future machines, whose cache sizes continue to grow, conflict misses do not contribute significantly to accurate miss modeling. Work in sparse compilers, e.g. Bik et al. 7] and the Bernoulli compiler [37], complements our own work. These projects focus on the expression of sparse kernels and data structures for code generation, and will likely prove valuable to generating our implementations. One distinction of our work is our use of a hybrid o# line, on line model for selecting transformations ....
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Performance Optimizations and Bounds for Sparse.. - Vuduc, Demmel.. (2002) (4 citations) (Correct)
....explicitly model execution time (instead of just modeling misses) in order to evaluate the extent to which our tuned implementations achieve optimal performance. Finally, we mention examples of work in the sparse compiler literature by Bik [2] Pugh and Shpeisman [25] and the Bernoulli compiler [28]. The first analyzes matrices for high level structure using techniques complementary those that we consider; the latter two consider sparse code specification and generation issues, but do not specialize for specific matrix structures. The tools and technology developed in these research projects ....
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Next-generation Generic Programming and its.. - Mateev, Pingali.. (2000) (10 citations) Self-citation (Stodghill) (Correct)
No context found.
Paul Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, July 1997. Also as Technical Report CORNELLCS:TR97-1635.
Next-generation Generic Programming and its.. - Mateev, Pingali.. (2000) (10 citations) Self-citation (Stodghill) (Correct)
No context found.
Paul Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, July 1997. Also as Technical Report CORNELLCS:TR97-1635.
Performance Modeling and Analysis of Cache Blocking.. - Nishtala, Vuduc.. (2004) (Correct)
No context found.
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
On the Conditions Necessary for Removing Abstraction.. - Lujan, Freeman, Gurd (2004) (Correct)
No context found.
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University,, 1997.
Automatic Performance Tuning and Analysis of Sparse .. - Vuduc, Kamil, Hsu, .. (2002) (Correct)
No context found.
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Oolala - From Numerical Linear Algebra To Compiler Technology For .. - Moreno (2002) (Correct)
No context found.
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University,, 1997.
Performance Tuning and Analysis of Sparse Triangular Solve .. - Richie Bebop Computer (2002) (Correct)
No context found.
Paul Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Performance Optimizations and Bounds for Sparse.. - Vuduc, Demmel, Yelick (2002) (4 citations) (Correct)
No context found.
Paul Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Memory Hierarchy Optimizations and Performance Bounds.. - Vuduc, Gyulassy.. (2003) (Correct)
No context found.
Paul Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Memory Hierarchy Optimizations and Performance Bounds .. - Vuduc, Gyulassy.. (2003) (Correct)
No context found.
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Performance Modeling and Analysis of Cache Blocking.. - Nishtala, Vuduc.. (2004) (Correct)
No context found.
P. Stodghill. A Relational Approach to the Automatic Generation of Sequential Sparse Matrix Codes. PhD thesis, Cornell University, August 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC