False sharing

Uses your system voice; voice and rate in settings.

Q5432732Snapshot

≈ 4 min read

Names in other languages

  • Русскийэффект ложного разделения кэша
  • EspañolUso compartido falso
  • EnglishFalse sharing
  • 한국어거짓 공유
  • 日本語偽共有
  • 中文伪共享

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

Multiprocessor CPU caches

By far the most common usage of this term is in modern multiprocessor CPU caches, where memory is cached in lines of some small power of two word size (e.g., 64 aligned, contiguous bytes). If two processors operate on independent data in the same memory address region storable in a single line, the cache coherency mechanisms in the system may force the whole line across the bus or interconnect with every data write, forcing memory stalls in addition to wasting system bandwidth. In some cases, the elimination of false sharing can result in order-of-magnitude performance improvements. False sharing is an inherent artifact of automatically synchronized cache protocols and can also exist in environments such as distributed file systems or databases, but current prevalence is limited to RAM caches.

Example

include include include include include include int main() { std::vector threads; const int hc = std::jthread::hardware_concurrency(); constexpr int testLimit = 256; // for simplicity up most that many elements for (int nThreads = 1; nThreads ( std::chrono::high_resolution_clock::now() - start ).count(); }, t); } threads.clear(); // join all threads std::cout (nsSum / (1.0e6 * nThreads)) This code shows the effect of false sharing. It creates an increasing number of threads from one thread to the number of physical threads in the system. Each thread sequentially increments one byte specific for that thread (i.e. not shared between them). The higher the level of contention between threads, the longer each increment takes, despite the fact that each thread is only incrementing its own piece of the global data. These are the results on an Intel Core i7 12th generation system with 6 performance and 8 efficiency cores yielding 20 threads: As one can see, concurrent access by those threads requires about 50 times more computing time than with mitigation where it approximately doubles.

Mitigation

There are ways of mitigating the effects of false sharing. For instance, false sharing in CPU caches can be prevented by reordering variables or adding padding (unused bytes) between variables. However, some of these program changes may increase the size of the objects, leading to higher memory use. Compile-time data transformations can also mitigate false-sharing. However, some of these transformations may not always be allowed. For instance, the C++ programming language standard draft of C++23 mandates that data members must be laid out so that later members have higher addresses. There are tools for detecting false sharing. There are also systems that both detect and repair false sharing in executing programs. However, these systems incur some execution overhead.

References

External links

Easy Understanding on False Sharing C++ today blog, False Sharing hits again! Dr Dobbs article: Eliminate False Sharing Be careful when trying to eliminate false sharing in Java

Text derived from https://en.wikipedia.org/w/index.php?oldid=1377079722 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot false-sharing-618179-e7d18a051656e96b · hash e7d18a051656e96bf306d720bcb955e591da582fb8399838302424c1924ac60a · captured 1790532665.0 · version history

Cite this page as: encyclopegia.org, “False sharing”, snapshot false-sharing-618179-e7d18a051656e96b. https://encyclopegia.org/a/false-sharing

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.