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

Communication protocol - internet protocol, The Internet protocol mentions ...

The Internet protocol mentions the rules that describe the details of how computers communicate. It exactly mentions how a packet should be formed & how a router should forward eac

Introduction-pram algorithms, One of the most popular models for designing ...

One of the most popular models for designing parallel algorithms is PRAM (Parallel Random Access Machine). A PRAM consists of unbounded number of processors interrelating with each

Was the entire transaction completed, The following information was obtaine...

The following information was obtained from a host computer: 00:05:17.176507 74.125.228.54.1270 > 64.254.128.66.25: S 2688560409:2688560409(0) win 16384 (DF) (ttl 46, id 2096

Maximum packet lifetime, Take the maximum packet lifetime, T.  It's stated ...

Take the maximum packet lifetime, T.  It's stated that T must be big enough to make sure the packet and its ACK have vanished.  Why do we have to have the ACK?

Connectionless service, In connectionless schema, there is no connection re...

In connectionless schema, there is no connection required. The source of data includes destination information in data and transmit to the network. Network transmit each data item

Define osi , OSI= Open System Interconnection.

OSI= Open System Interconnection.

How is hop-by-hop segmentation of the ipv6 packets avoided, Question 1: ...

Question 1: (a) How are IPv4 addresses transformed into IPv6 addresses using IPv4 compatible addresses? (b) Name some of the simplifications that were introduced in IPv6.

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