Basic HTML version of Foils prepared May 7 1996

Foil 26 Computer Architectures - Shared Memory

From MetaComputing -- MRA Meeting Part I:Concepts and Issues Tutorial for CRPC MRA Meeting at Cornell -- May 7 1996. by Mark Baker, Geoffrey Fox


Data sharing among tasks is fast (speed of memory access).
Attractive feature of shared memory is that the time to communicate among the tasks is effectively a factor of a single fixed value, that being "the time it takes a single task to read a single location."
Disadvantage: scalability is limited by number of access pathways to memory.
If there are more tasks than connections to memory, you have contention for access to the desired locations, and this amounts to increased latencies while all tasks obtain the required values. So the degree to which you can effectively scale a shared memory system is limited by the characteristics of the communication network coupling the processors to the memory units.



Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Apr 11 1999