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

Describe the object modeling notations, OBJECT MODELING NOTATIONS: BASIC ...

OBJECT MODELING NOTATIONS: BASIC Concepts A system is the collection of subsystems which organised to accomplish a purpose and described by a set of models from variou

Main features of TCP, The main features of TCP are: Reliability: TCP...

The main features of TCP are: Reliability: TCP makes sure that any data sent by a sender arrives at destination as it was sent. There can't be any data loss or change in the

Arrays, how to calculate students''s averange test scores

how to calculate students''s averange test scores

Explain the various interface circuits, Explain the various interface circu...

Explain the various interface circuits.  An I/O interface having of circuitry required to connect an I/O device to computer bus. One side having of a data path with its associa

Illustrate arithmetic shifts with example, Q. Illustrate Arithmetic shifts ...

Q. Illustrate Arithmetic shifts with example? Arithmetic shifts ARITHMETIC SHIFT LEFT and ARITHMETIC SHIFT RIGHT are same as LOGICAL SHIFT LEFT and LOGICAL SHIFT RIGHTexcept th

Define a variant of top-down parsing without backtracking, A parser which i...

A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.

Karnaugh maps, Minimisation using Boolean algebra is not always straight fo...

Minimisation using Boolean algebra is not always straight forward and sometimes it is not obvious if a further manipulation would give a simpler circuit. Karnaugh maps are a muc

Implement a memory management system , There should be 1 server thread and ...

There should be 1 server thread and N client threads, where N is supplied by the user as a command line argument. The server opens a file called "all_requests.dat", the file has

Explian two limitations of dead-box analysis, (a) Explian two limitations o...

(a) Explian two limitations of dead-box analysis. (b) Describe why memory analysis is difficult. (c) With reference to the "Shadow Walker" rootkit, explain what is meant by

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