Home arrow Technology arrow Parralel Computing Turorial

Language Translator

Hacking Zone

Hacking Tools
Attacking

Configure Windows

Windows Configuration

Novels

Mix Novels

Human Personality

Body Language
Parralel Computing Turorial PDF Print E-mail
Written by Hemanshu Patel   
Sunday, 23 December 2007
Article Index
Parralel Computing Turorial
Page 2
Page 3
Page 4
Page 5
Page 6
Page 7
Page 8
Page 9
Page 10
Page 11
Page 12
Page 13
Page 14
Page 15
Page 16
Page 17
Page 18


Parallel Computer Memory Architectures

Distributed Memory

General Characteristics:


* Like shared memory systems, distributed memory systems vary widely but share a common characteristic. Distributed memory systems require a communication network to connect inter-processor memory.

Distributed memory architecture


* Processors have their own local memory. Memory addresses in one processor do not map to another processor, so there is no concept of global address space across all processors.

* Because each processor has its own local memory, it operates independently. Changes it makes to its local memory have no effect on the memory of other processors. Hence, the concept of cache coherency does not apply.

* When a processor needs access to data in another processor, it is usually the task of the programmer to explicitly define how and when data is communicated. Synchronization between tasks is likewise the programmer's responsibility.

* The network "fabric" used for data transfer varies widely, though it can can be as simple as Ethernet.

Advantages:

* Memory is scalable with number of processors. Increase the number of processors and the size of memory increases proportionately.
* Each processor can rapidly access its own memory without interference and without the overhead incurred with trying to maintain cache coherency.
* Cost effectiveness: can use commodity, off-the-shelf processors and networking.

Disadvantages:

* The programmer is responsible for many of the details associated with data communication between processors.
* It may be difficult to map existing data structures, based on global memory, to this memory organization.
* Non-uniform memory access (NUMA) times



Last Updated ( Sunday, 23 December 2007 )
 
< Prev
Your Ad Here

Donate us!!

Enter Amount:

RSS socialnet

Add to MyYahoo!
Subscribe in NewsGator Online
Add to Newsburst
Add to Google
Add to My AOL
Add to Pluck
Subscribe in FeedLounge
Add to Windows Live
Add to NetVibes
Subscribe in Rojo
Subscribe in Bloglines
Add to MyMSN
Add to Plusmo for your cellphone
Add to PageFlakes
Add to Technorati
Add to BlinkBits