Parallel random access machines, Computer Networking

Assignment Help:

PRAM is one of the models used for designing the parallel algorithm as given in Figure. The PRAM models have the following components:

  • A set of identical type of processors state P1, P2, P3 ...Pn.
  • It contains a single shared memory module being shared by all the N processors. As the processors can't communicate with each other directly, shared memory acts as a communication medium for the processors.
  • In direct to connect the N processor with the single shared memory, a component called Memory Access Unit (MAU) is used for accessing the shared memory.

2210_PRAM Model.png

                                                                     PRAM Model

The Following steps are followed by a PRAM model while implementing an algorithm:

i)  Read phase: Firstly, the N processors concurrently read data from N different memory locations of the shared memory and subsequently save the read data into its local registers.

ii)  Compute phase: After that, these N processors perform the logical or arithmetic operation on the data stored in their local registers.

iii) Write phase: Lastly, the N processors parallel write the computed values from their local registers into the N memory locations of the shared memory.


Related Discussions:- Parallel random access machines

What is an interrupt request, Question: a) Briefly describe the purpos...

Question: a) Briefly describe the purpose of Windows Powershell? b) Name three ways software can be installed on Linux? c) What is an interrupt request? d) As the

Introduction to operating system for parallel computer, INTRODUCTION T...

INTRODUCTION This part discusses the additional requirements at software levels and operating system which will create the parallel programs run on parallel hardware. Collecti

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Explain token passing -token ring, Token Passing - Token Ring (IEEE 802.5) ...

Token Passing - Token Ring (IEEE 802.5) Needs that station take turns sending data Token passing coordinates process Token is a especially formatted three-byte fr

Distribution of dns - application layer , Distribution of DNS 1.By cen...

Distribution of DNS 1.By centralized data base The information contained in the domain  name space must be stored. A simple design  or DNS would have one DNS server that co

Explain sonet frame transaction, Sonet Frame Transaction Transmitted ...

Sonet Frame Transaction Transmitted one subsequent to another without any gap in between. First 2 bytes - alignment bytes. F628 in Hex. - define the beginning of every

What are instance variables, What are instance variables? Instance vari...

What are instance variables? Instance variables are those which are explained at the class level. Instance variables require not be initialized before using them as they are au

Diffuse reflection in the basic illumination model, Question: (a) By ma...

Question: (a) By making use of an example, explain the Cohen-Sutherland line clipping algorithm. (b) Compare and contrast between the CMY and RGB colour models. (c) Expla

Explain routing loop issue in rip protoco, Can you determine routing loop i...

Can you determine routing loop issue in RIP protocol?

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