A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
An Approach for Semiautomatic Locality Optimizations Using OpenMP
[chapter]
2012
Lecture Notes in Computer Science
The processing power of multicore CPUs increases at a high rate, whereas memory bandwidth is falling behind. Almost all modern processors use multiple cache levels to overcome the penalty of slow main memory; however cache efficiency is directly bound to data locality. This paper studies a possible way to incorporate data locality exposure into the syntax of the parallel programming system OpenMP. We study data locality optimizations on two applications: matrix multiplication and Gauß-Seidel
doi:10.1007/978-3-642-28145-7_29
fatcat:pnlzpvfi65fajih63nchg7wqoi