Keeping cache line size and number of processors constant, false sharing decreases with increasing array size because each processor sorts more elements, so for a given cache line the probability that the line is filled with elements from a single processor increases.
nemo
@jmc I am not sure that is the best way to understand why an increase in N reduces misses due to false sharing. I think a more intuitive explanation is that as N increases, there are simply more number of cache lines where data of the array resides. So, the probability that two processors at any point in time will be modifying the same line decreases!
Keeping cache line size and number of processors constant, false sharing decreases with increasing array size because each processor sorts more elements, so for a given cache line the probability that the line is filled with elements from a single processor increases.
@jmc I am not sure that is the best way to understand why an increase in N reduces misses due to false sharing. I think a more intuitive explanation is that as N increases, there are simply more number of cache lines where data of the array resides. So, the probability that two processors at any point in time will be modifying the same line decreases!