False sharing
In computer science, false sharing is a performance-degrading usage pattern that can arise in systems with distributed, coherent caches at the size of the smallest resource block managed by the caching mechanism. When a system participant attempts to periodically access data that is not being altered by another party, but that data shares a cache block with data that is being altered, the caching protocol may force the first participant to reload the whole cache block despite a lack of logical necessity. The caching system is unaware of activity within this block and forces the first participant to bear the caching system overhead required by true shared access of a resource.
False sharing - Wikipedia Jump to content From Wikipedia, the free encyclopedia Performance-degrading usage pattern In computer science , false sharing is a performance-degrading usage pattern that can arise in systems with distributed, coherent caches at the size of the smallest resource block managed by the caching mechanism. When a system participant attempts to periodically access data that is not being altered by another party, but that data shares a cache block with data that is being altered, the caching protocol may force the first participant to reload the whole cache block despite a
related reading
- Cache coherence - Wikipediaen.wikipedia.org
- How to Optimize a CUDA Matmul Kernel for cuBLAS-like Performance: a Worklogsiboehm.com
- Cache Lines - Algorithmicaen.algorithmica.org
- A very concrete explanation of how a cache worksparksb.github.io
- abseil / Performance Hintsabseil.io
- Using Shared Memory in CUDA C/C++ | NVIDIA Technical Blogdeveloper.nvidia.com
- Reading 14: Concurrencyweb.mit.edu
- BrrrVizbrrrviz.com
- Inter-process communication in Linux: Shared storage | Opensource.comopensource.com
- CMSY9people.csail.mit.edu
- Multithreading (computer architecture) - Wikipediaen.wikipedia.org
- Reading privileged memory with a side-channel - Project Zerogoogleprojectzero.blogspot.com