MADHAV INSTITUTE OF TECHNOLOGY
AND SCIENCE
Subject : Distributed shared memory
SUBMITTED TO : DR PAWAN DUBEY
Submitted by :Aditya Singh Tomar
WHAT IS DISTRIBUTED SHARED MEMORY
• DSM IS A MECHANISM THAT MANAGES MEMORY ACROSS MULTIPLE NODES AND
MAKES INTER-PROCESS COMMUNICATIONS TRANSPARENT TO END-USERS. THE
APPLICATIONS WILL THINK THAT THEY ARE RUNNING ON SHARED MEMORY.
TYPES OF DISTRIBUTED SHARED MEMORY
• ON-CHIP MEMORY
• BUS-BASED MULTIPROCESSORS
• RING-BASED MULTIPROCESSORS
ON-CHIP MEMORY
• THE DATA IS PRESENT IN THE CPU PORTION OF THE CHIP.
• MEMORY IS DIRECTLY CONNECTED TO ADDRESS LINES.
• ON-CHIP MEMORY DSM IS EXPENSIVE AND COMPLEX.
BUS-BASED MULTIPROCESSORS
• A SET OF PARALLEL WIRES CALLED A BUS ACTS AS A CONNECTION BETWEEN
CPU AND MEMORY.
• ACCESSING OF SAME MEMORY SIMULTANEOUSLY BY MULTIPLE CPUS IS
PREVENTED BY USING SOME ALGORITHMS
• CACHE MEMORY IS USED TO REDUCE NETWORK TRAFFIC
RING-BASED MULTIPROCESSORS:
• THERE IS NO GLOBAL CENTRALIZED MEMORY PRESENT IN RING-BASED DSM.
• ALL NODES ARE CONNECTED VIA A TOKEN PASSING RING.
• IN RING-BASES DSM A SINGLE ADDRESS LINE IS DIVIDED INTO THE SHARED
AREA.
ADVANTAGES OF DISTRIBUTED SHARED
MEMORY
• SIMPLER ABSTRACTION: PROGRAMMER NEED NOT CONCERN ABOUT DATA MOVEMENT, AS THE
ADDRESS SPACE IS THE SAME IT IS EASIER TO IMPLEMENT THAN RPC.
• EASIER PORTABILITY: THE ACCESS PROTOCOLS USED IN DSM ALLOW FOR A NATURAL TRANSITION
FROM SEQUENTIAL TO DISTRIBUTED SYSTEMS. DSM PROGRAMS ARE PORTABLE AS THEY USE A
COMMON PROGRAMMING INTERFACE.
• LOCALITY OF DATA: DATA MOVED IN LARGE BLOCKS I.E. DATA NEAR TO THE CURRENT MEMORY
LOCATION THAT IS BEING FETCHED, MAY BE NEEDED FUTURE SO IT WILL BE ALSO FETCHED.
• ON-DEMAND DATA MOVEMENT: IT PROVIDED BY DSM WILL ELIMINATE THE DATA EXCHANGE PHASE.
• LARGER MEMORY SPACE: IT PROVIDES LARGE VIRTUAL MEMORY SPACE, THE TOTAL MEMORY SIZE IS
THE SUM OF THE MEMORY SIZE OF ALL THE NODES, PAGING ACTIVITIES ARE REDUCED.
• BETTER PERFORMANCE: DSM IMPROVE PERFORMANCE AND EFFICIENCY BY SPEEDING UP ACCESS TO
DATA.
