Reordering Algorithms for Increasing Locality on Multicore Processors
In order to efficiently exploit available parallelism, mul- ticore processors must address contention for shared re- sources as cache hierarchy. This fact becomes even more important when irregular codes are executed on them, which is the case for sparse matrix ones.
Palabras clave:
Publicación: Congreso
1624015016590
18 de xuño de 2021
/research/publications/reordering-algorithms-for-increasing-locality-on-multicore-processors
In order to efficiently exploit available parallelism, mul- ticore processors must address contention for shared re- sources as cache hierarchy. This fact becomes even more important when irregular codes are executed on them, which is the case for sparse matrix ones. - Juan C. Pichel, David E. Singh, Jesús Carretero - 10.1109/HPCC.2008.96
publications_gl