Basic HTML version of Foils prepared
13 February 2000
Foil 18 Distributed Shared Memory Machines
From
Methodology of Computational Science CPS615 Computational Science --
Spring Semester 2000
.
by
Geoffrey C. Fox
Combining the (dis)advantages of shared and distributed memory
Lots of hierarchical designs are appearing.
Typically, "shared memory nodes" with 4 to 32 processors
Each processor has a local cache
Processors within a node access shared memory
Nodes can get data from or put data to other nodes' memories
©
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 Thu Mar 16 2000
Basic HTML version of Foils prepared 13 February 2000
