@inproceedings{0beef86e8f19466b87cd5c36885da84f,

title = "Rescheduling for locality in sparse matrix computations",

abstract = "In modern computer architecture the use of memory hierarchies causes a program{\textquoteright}s data locality to directly affect performance. Data locality occurs when a piece of data is still in a cache upon reuse. For dense matrix computations, loop transformations can be used to improve data locality. However, sparse matrix computations have non-affine loop bounds and indirect memory references which prohibit the use of compile time loop transformations. This paper describes an algorithm to tile at runtime called serial sparse tiling. We test a runtime tiled version of sparse Gauss-Seidel on 4 different architectures where it exhibits speedups of up to 2.7. The paper also gives a static model for determining tile size and outlines how overhead affects the overall speedup.",

author = "Strout, {Michelle Mills} and Larry Carter and Jeanne Ferrante",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; International Conference on Computational Science, ICCS 2001 ; Conference date: 28-05-2001 Through 30-05-2001",

year = "2001",

doi = "10.1007/3-540-45545-0_23",

language = "English (US)",

isbn = "3540422323",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "137--146",

editor = "Alexandrov, {Vassil N.} and Dongarra, {Jack J.} and Juliano, {Benjoe A.} and Renner, {Ren{\'e} S.} and {Kenneth Tan}, C.J.",

booktitle = "Computational Science - ICCS 2001 - International Conference, 2001, Proceedings",

}