DSM Architecture & its Types

DSM ARCHITECTURE AND ITS TYPES
Distributed Shared Memory(DSMArchitecture:
         What
1.The distributed shared memory (DSMimplements the shared memory model in distributed systems, which have no physical shared memory
2.The shared memory model provides a virtual address space shared between all nodes
3.The overcome the high cost of communication in distributed systems, DSM systems      move data to the location of access
         How:
1.Data moves between main memory and secondary memory (within a nodeand between main memories of different nodes
2.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
3.When a process accesses data in the shared address space, the mapping manager maps shared memory address to physical memory (local or remote)
Advantages of distributed shared memory (DSM):
         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 nodesLarge programs can run more efficiently
         No serial access to common bus for shared physical memory like in multiprocessor systems
         Programs written for shared memory multiprocessors can be run on DSM systems with minimum changes

Types of DSM:
1.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.


2.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.


3.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 ringAll components are interconnected via Memnet device.
·         No centralized global memory.


4.Switched Multiprocessors:
·         Two approaches can be taken to attack the problem of not enough bandwidth.
·         Reduce the amount of communicationE.gCaching.
·         Increase the communication capacityE.gChanging topology.
·         One method is to build the system as a hierarchyBuild the system as multiple clusters and connect the clusters using an intercluster busAs long as most CPUs communicate primarily within their own cluster, there will be relatively little intercluster trafficIf still more bandwidth is needed, collect a bus, tree, or grid of clusters together into a supercluster, and break the system into multiple superclusters.



Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.