A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Reordering Algorithms for Increasing Locality on Multicore Processors
2008
2008 10th IEEE International Conference on High Performance Computing and Communications
In order to efficiently exploit available parallelism, multicore processors must address contention for shared resources as cache hierarchy. This fact becomes even more important when irregular codes are executed on them, which is the case for sparse matrix ones. In this paper a technique for increasing locality of sparse matrix codes on multicore platforms is presented. The technique consists on reorganizing the data guided by a locality model which introduces the concept of windows of
doi:10.1109/hpcc.2008.96
dblp:conf/hpcc/PichelSC08
fatcat:thxmxf73orcndpadu5gjbrutnm