---
title: Distributed shared memory
slug: distributed-shared-memory
qid: 
snapshot: enwiki-001378028712
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1378028712
tags: [115984983, 22944200, 23118434, 23603337, 24043274, 24623845, 24745121, 26748027, 50366161, 81199107]
---

# Distributed shared memory

> [!note] Provenance
> Snapshot `enwiki-001378028712` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1378028712> · Licensed CC BY-SA 4.0

In computer science, distributed shared memory (DSM) is a form of memory architecture where physically separated memories can be addressed as a single shared address space. The term "shared" does not mean that there is a single centralized memory, but that the address space is shared—i.e., the same physical address on two processors refers to the same location in memory. Distributed global address space (DGAS), is a similar term for a wide class of software and hardware implementations, in which each node of a cluster has access to shared memory in addition to each node's private (i.e., not shared) memory.

In computer science, distributed shared memory (DSM) is a form of memory architecture where physically separated memories can be addressed as a single shared address space. The term "shared" does not mean that there is a single centralized memory, but that the address space is shared—i.e., the same physical address on two processors refers to the same location in memory. Distributed global address space (DGAS), is a similar term for a wide class of software and hardware implementations, in which each node of a cluster has access to shared memory in addition to each node's private (i.e., not shared) memory. ==Directory memory coherence== Memory coherence is necessary such that the system which organizes the DSM is able to track and maintain the state of data blocks in nodes across the memories comprising the system. A directory is one such mechanism which maintains the state of cache blocks moving around the system. ==Replication== There are two types of replication algorithms. Read replication and Write replication: in Read replication multiple nodes can read at the same time but only one node can write, while in Write replication multiple nodes can read and write at the same time. The write requests are handled by a sequencer. Replication of shared data in general tends to reduce network traffic, promote increased parallelism and result in fewer page faults. Preserving coherence and consistency may become more challenging. ==Release and entry consistency== Release consistency is when a process exits a critical section, new values of the variables are propagated to all sites. Entry consistency is when a process enters a critical section, it will automatically update the values of the shared variables. View-based consistency is a variant of entry consistency, except the shared variables of a critical section are automatically detected by the system. ==See also== ==References== ==External links== Distributed Shared Cache Memory coherence in shared virtual memory systems by Kai Li, Paul Hudak published in ACM Transactions on Computer Systems, Volume 7 Issue 4, Nov. 1989
