This example shows how to improve temporal locality.
shpeefps
This example and the next example proceed to show ways to improve a situation we have been studying throughout this course. Through the semester we often evaluated the parallelizability of code based on its arithmetic intensity (number of instructions/number of memory accesses). This lecture, we focus on how we can increase the arithmetic intensity of code to make it less limited by bandwidth or memory latency.
This example shows how to improve temporal locality.
This example and the next example proceed to show ways to improve a situation we have been studying throughout this course. Through the semester we often evaluated the parallelizability of code based on its arithmetic intensity (number of instructions/number of memory accesses). This lecture, we focus on how we can increase the arithmetic intensity of code to make it less limited by bandwidth or memory latency.