Structure of shared memory space

STRUCTURE OF SHARE MEMORY SPACE
Structure defines the abstract view of the shared memory space.
The structure and granularity of a DSM system are closely related three approaches:
·         No structuring
·         Structuring by data type
·         Structuring as a database
 1. NO SRTUCTURING:-
Ø  The shared memory space is simply a linear array of words.
ADVANTAGE:-
Ø  Choose any suitable page size as the unit of sharing and a fixed grain size may be used for all application.
Ø  Simple and easy to design such a DSM system.

2. STRUCTURING BY DATA TYPE:-
Ø  The shared memory space is structured either as a collection of variables in the source language.
Ø  The granularity in such DSM system is an object or a variable.

Ø  DSM system use variable grain size to match the size of the object/variable being accessed by the application.

3. STRUCTURING AS A DATABASE:-
Ø  Structure the shared memory like a database.

Ø  Shared memory space is ordered as an associative memory called tuple space.

Ø  To perform update old data item in the DSM are replaced by new data item.

Ø  Processes select tuples by specifying the number of their fields and their values or type.

Ø  Access to shared data is non transparent. Most system they are transparent.

More topics from Distributed System to read:

DISTRIBUTED SYSTEM

EasyExamNotes.com covered following topics in these notes.
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.