Diffrentiate b/w shared memory and distributed memory, Computer Engineering

Assignment Help:

Shared Memory 

Shared Memory refers to memory component of a computer system in which the memory can accessed directly by any of the processors in the system.

Distributed Memory 

Refers to the 'Network based memory' in which there isn't any common address space for several memory modules including the memory system of (networked) system. Normally, a processor or group of processors have a memory module associated with it, not dependent on the memory modules associated with other processors or group of processors.

 


Related Discussions:- Diffrentiate b/w shared memory and distributed memory

Network throughput-network properties, Network throughput It is an indi...

Network throughput It is an indicative measure of the point carrying capacity of a network. It is distinct as the total number of messages the network can transmit per unit tim

Accessing the internet, Before we can use Internet, we have to gain access ...

Before we can use Internet, we have to gain access to it. This access is achieved in one of numerous ways. Above all, the Internet is a collection of networks which are connected t

What are the steps followed in testing, What are the steps followed in test...

What are the steps followed in testing? i. Unit testing - The individual components are tested in this method of testing. ii. Module testing - Related collection of independ

Compact disc - computer storage, Compact Disc; Compact Disc ( CD)   i...

Compact Disc; Compact Disc ( CD)   is an optical disc  which is used to  store digital data. It was initially developed to store sound recordings completely, but later it als

How client and server use same protocol port at same time, Can both client ...

Can both client and server use the same protocol port on the same computer at the same time? Explain. Client and server can't use similar port number on similar computer at ide

What is minimum spanning tree, Minimum Spanning Tree: Given a weighted gra...

Minimum Spanning Tree: Given a weighted graph G, it is often desired to make a spanning tree T for G, like the sum of weights of the edges in T is the least. Like tree is known as

What is static timing, What is Static timing a. Delays over all paths a...

What is Static timing a. Delays over all paths are added up. b. All possibilities, including false paths, verified without the need for test vectors. c. Faster than simul

System analysis and design, write an algorithm on railway reservation ticke...

write an algorithm on railway reservation ticket window

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd