how the cache size and array size affect the performance of mathematical
operations on an array?
I am trying to learn the usage of cache. From what I see by doing some
sample experiment program, the time taken for execution of a program
iterating through an array and doing some operations on the elements
suddenly increases very much if I increase the array size beyond a
particular value.Can anyone explain in simple terms how the cache size and
array size affect the performance of mathematical operations on an array?
No comments:
Post a Comment