False sharing problems in cluster-based disk arrays
Proceedings of the 1999 ACM symposium on Applied computing
Adaptive Sector Grouping to Reduce False Sharing in Distributed RAID
Cluster Computing
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Dynamic cache contention detection in multi-threaded applications
Proceedings of the 7th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Detection of false sharing using machine learning
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
Efficiently supporting a shared memory paradigm in a large-scale multiprocessor generally involves some form of data caching. One of the drawbacks of caching shared data is the cost of keeping the multiple copies coherent. One source of unnecessary coherency overhead is caused by a problem known as {\em false sharing.} Unfortunately, the lack of a precise, universally accepted, definition of false sharing hinders research to detect and eliminate the problem. We attempt to detect when such a problem exists and to identify the specific root causes of the problem. To accomplish this, we propose an architecture-independent measure of the false sharing exhibited in a reference trace for cache lines of a specified size. We motivate the importance of a concrete measure by demonstrating that false sharing related coherence overhead comprises a significant portion of the coherence costs in real applications, especially when page-granularity coherence is required. Experiments are performed to show the usefulness of this formulation.