How to describe the amount of cache that improves performance by enabling fast data reuse within the program?
Robert Reed said "cache footprint can be thought of as the amount of cache that improves performance by enabling fast data reuse within the program."
so how to describe the amount of cache ? Could we decribe cache footprint by the amount of cache entry process accesses when CPU execute application?
what else elements could be thought as criterion to decribe cache footprint ?
There are programming techniques whereby you sequence through portions of the entire data set providing re-use of data fetched earlier. Two of several examples of this is the practice of tiling for matrix operations and pipelining for data flow processing (although you can pipeline Matrix operations as well). Part-3 (August 11th) on the Communities | Parallel Programming is an article thatwill illustrate one method of tiling for Matrix Multiplication (parts 4 and 5 will expand upon this).