Presentation2

350 views

Published on

Published in: Technology, Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
350
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
12
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Presentation2

  1. 1. Making the main memory of acluster of computers look as thoughit is a single memory with a singleaddress space.Then can use shared memoryprogramming techniques.
  2. 2.  System scalable Hides the message passing – do not explicitlyspecific sending messages between processesSimple extensions to sequential programmingCan handle complex and large data bases withoutreplication or sending the data to processes
  3. 3. May incur a performance penaltyMust provide for protection against simultaneousaccess to shared dataLittle programmer control over actual messagesbeing generatedPerformance of irregular problems in particular maybe difficult
  4. 4. •Special network interfaces and cache•Modifying the OS Kernel•Adding a software layer between the operatingsystem and the application – most convenientway for teaching purposes
  5. 5. •Page based – using the system’s virtualmemory•Shared variable approach – using routines toaccess shared variables•Object based – shared data within collectionof objects. Access to shared data through objectoriented discipline
  6. 6. • Easy to do• Can sit on top of message-passing software such as MPI
  7. 7. • Managing shared data –reader/writer policies• Timing issues – relaxingread/write orders
  8. 8. • Single reader/single writer policy – simple to dowith centralized servers• Multiple reader/single writer policy – again quitesimple to do• Multiple reader/multiple writer policy - tricky

×