What is Distributed Shared Memory?

The distributed shared memory (DSM) implements the shared memory model in
distributed systems, which have no physical shared memory.
The shared memory model provides a virtual address space shared between all nodes.
The overcome the high cost of communication in distributed systems, DSM systems
move data to the location of access.

How DSM Architecture Work?

Data moves between main memory and secondary memory (within a node) and between
main memories of different nodes.
Each data object is owned by a node: Initial owner is the node that created object
Ownership can change as object moves from node to node.
When a process accesses data in the shared address space, the mapping manager maps
shared memory address to physical memory (local or remote).
 DSM Architecture Model

Node 1 Node 2 Node n

Memory Memory Memory

Mapping Mapping Mapping

Manager Manager Manager

Shared Virtual Memory

 Advantages of Distributed Shared Memory

 Data sharing is implicit, hiding data movement.

 Passing data structures containing pointers is easier.
 Moving entire object to user takes advantage of locality difference.
 Less expensive to build than tightly coupled multiprocessor system.
 Very large total physical memory for all nodes: Large programs can run more
efficiently.
 Data block keep migrating from one node to another on demand but no
communication is visible to the user processes.
 Programs written for shared memory multiprocessors can be run on DSM
systems with minimum changes.
 Types of Distributed Shared Memory

On-Chip Memory

 Such chips are widely used in appliances cars and even toys.
 CPU portion of the chip has data.
 Address lines directly connect to memory portion.
 It is expensive and complicated to construct chip like this.
 Types of Distributed Shared Memory Continued..

Bus-Based Multiprocessors

 Connection between CPU and memory is set of parallel wires some holding
address of CPU wants to read or write or for sending or receiving messages.
 Network traffic is reduced by using caches with each CPU.
 Algorithms are used to prevent two CPU trying to access same memory
simultaneously.
 Having single bus makes it overloaded.
 Types of Distributed Shared Memory Continued..

Ring-Based Multiprocessors

 A single address line is

partitioned into a private
area and shared area.
 Private area is divided up
into regions so each machine
has a piece for its stack.
 Shared area is divided into
32 byte blocks.
 All machines are connected
via token passing ring. All
components are
interconnected via Memnet
device.
 No centralized global
memory.
 What is Distributed Shared Memory?
Granularity :-
 Granularity refers to the block size of DSM.
 The unit of sharing and the unit of data transfer across the network block fault occurs.
 Possible unit are few word, a page or a few pages.
Structure of Shared Memory :-
 Structure refers to the layout of the shared data in memory.
 Dependent on the type of applications that the DSM system is intended to support.
Memory Coherence & Access Synchronization :-
 In a DSM system that allows replication of shared data item, copies of shared data item may
simultaneously be available in the main memories of a number of nodes.
 To solve the memory coherence problem that deal with the consistency of a piece of shared data lying in
the main memories of two or more nodes.
Data Location & Access :-
 To share data in a DSM, should be possible to locate and retrieve the data accessed by user process.
Replacement Strategy :-
 If the local memory of a node is full, a cache miss at that node implies not only a fetch of accessed data
block from a remote node but also a replacement.
 Data block must be replaced by the new data block.
Thrashing :-
 Data block migrate between nodes on demand. Therefore if two nodes compete for write access to a single
data item the corresponding data block may be transferred back.
Heterogeneity :-
 The DSM system built for homogeneous system need not address the heterogeneity issue.
Thank you