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 a pseudo TTY, What is a pseudo tty? A pseudo tty or false termi...

What is a pseudo tty? A pseudo tty or false terminal enables external machines to connect by Telnet or rlogin. Without a pseudo tty, no connection can take place.

Comp architecture, In reg-mem architecture, clock cycle is 10 ns wide. It i...

In reg-mem architecture, clock cycle is 10 ns wide. It is proposed that reg-reg architecture be used instead, that reduces the clock cycle by 2 ns. However, it requires an addition

Uses of fragmentation and reassembly, Uses of fragmentation and reassembly ...

Uses of fragmentation and reassembly The More bit is used for fragmentation and reassembly. If this bit is 0, then either there has been no fragmentation of this packet or this

Comparison of distance-vector and link-state algorithm, DISTANCE-VECTOR ROU...

DISTANCE-VECTOR ROUTING: It is easy to implement. Packet switch modifies its own routing table first. It is used in RIP. LINK-STATE ALGORITHM: It is ve

Determine the application areas of intranet, Determine the Application area...

Determine the Application areas of intranet The uses of an Intranet are only limited by imagination. Some of the larger sectors where the Intranet can be easily and success fu

Framing, different framing methods

different framing methods

Define interconnection network, Interconnection Network An interconnect...

Interconnection Network An interconnection network is designed for transferring data between two processors in a Multi-stage network. Memory bottleneck is a fundamental limitat

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