- Memory coherence
-
Memory coherence is an issue that affects the design of computer systems in which two or more processors or cores share a common area of memory.[1][2][3][4]
In a uniprocessor system (whereby, in today's terms, there exists only one core), there is only one processing element doing all the work and therefore only one processing element that can read or write from/to a given memory location. As a result, when a value is changed, all subsequent read operations of the corresponding memory location will see the updated value, even if it is cached.
Conversely, in multiprocessor (or multicore) systems, there are two or more processing elements working at the same time, and so it is possible that they simultaneously access the same memory location. Provided none of them changes the data in this location, they can share it indefinitely and cache it as they please. But as soon as one updates the location, the others might work on an out-of-date copy that, e.g., resides in their local cache. Consequently, some scheme is required to notify all the processing elements of changes to shared values; such a scheme is known as a "memory coherence protocol", and if such a protocol is employed the system is said to have a "coherent memory".
The exact nature and meaning of the memory coherency is determined by the consistency model that the coherence protocol implements. In order to write correct concurrent programs, programmers must be aware of the exact consistency model that is employed by their systems.
When implemented in hardware, the coherency protocol can, e.g., be directory based or employ snooping (a.k.a "sniffing"). Examples of specific protocols are the MSI protocol and its derivatives MESI, MOSI and MOESI.
References
- ^ Censier, L.M.; Feautrier, P. (December 1978). "A New Solution to Coherence Problems in Multicache Systems". IEEE Transactions on Computers (IEEE) C-27 (12): 1112–1118. doi:10.1109/TC.1978.1675013.
- ^ Smith, Alan Jay (September 1982). "Cache Memories" (pdf). ACM Computing Surveys (ACM) 14 (3): 473–530. doi:doi.acm.org/10.1145/356887.356892. http://doi.acm.org/10.1145/356887.356892. Retrieved 2011-02-25.
- ^ Li, Kai; Hudak, Paul (November 1989). "Memory coherence in shared virtual memory systems" (pdf). Transactions on Computer Systems (ACM) 7 (4): 321–359. doi:doi.acm.org/10.1145/75104.75105. http://doi.acm.org/10.1145/75104.75105. Retrieved 2011-02-25.
- ^ Stenstrom, Per (June 1990). "A survey of cache coherence schemes for multiprocessors". IEEE Computer (IEEE) 23 (6): 12–24. doi:10.1109/2.55497.
See also
- Bus sniffing
- Cache coherence
- Consistency model
- Directory-based coherence protocols
- Distributed shared memory
- Race condition
Parallel computing General Levels Threads Theory Elements Coordination Multiprocessing · Multithreading (computer architecture) · Memory coherency · Cache coherency · Cache invalidation · Barrier · Synchronization · Application checkpointingProgramming Hardware Multiprocessor (Symmetric · Asymmetric) · Memory (NUMA · COMA · distributed · shared · distributed shared) · SMT
MPP · Superscalar · Vector processor · Supercomputer · BeowulfAPIs Ateji PX · POSIX Threads · OpenMP · OpenHMPP · PVM · MPI · UPC · Intel Threading Building Blocks · Boost.Thread · Global Arrays · Charm++ · Cilk · Co-array Fortran · OpenCL · CUDA · Dryad · DryadLINQProblems Embarrassingly parallel · Grand Challenge · Software lockout · Scalability · Race conditions · Deadlock · Livelock · Deterministic algorithm · Parallel slowdown
Category · Commons Categories:
Wikimedia Foundation. 2010.