by Tor E. Jeremiassen and Susan J. Eggers.
This paper evaluates that technique. We show through simulation that our analysis successfully identifies the data structures that are responsible for most false sharing misses, and then transforms them without unduly decreasing spatial locality. The reduction in false sharing positively impacts both execution time and program scalability when executed on a KSR2. Both factors combine to increase the maximum achievable speedup for all programs, more than doubling it for several. Despite being able to only approximate actual inter-processor memory accesses, the compiler-directed transformations always outperform programmer efforts to eliminate false sharing.
@inproceedings(JeEg95:PPOPP,
author="T.E. Jeremiassen and S.J. Eggers",
title={Reducing False Sharing on Shared Memory Multiprocessors through
Compile Time Data Transformations},
booktitle={7th ACM SIGPLAN Symposium on Principles \& Practice of
Parallel Programming},
pages="179-188",
month="July",
year="1995"
}