In pram model steps required for executing an algorithm, Computer Engineering

Assignment Help:

Q. In PRAM model steps required for executing an algorithm?

Subsequent steps are performed by a PRAM model whenever executing an algorithm:

i) Read phase: First the N processors concurrently read data from N various memory locations of shared memory and later store the read data in its local registers.

ii) Compute phase: Afterwards these N processors carry out the arithmetic or logical operation on data stored in their local registers.

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


Related Discussions:- In pram model steps required for executing an algorithm

Explain the working of thousand line exchanges, E xplain the working of th...

E xplain the working of thousand line exchanges by u sing a combination of uniselectors and two motion selectors. The schematic diagram for such an exchange is demonstrated i

What is structural hazard, What is structural hazard? Structural hazard...

What is structural hazard? Structural hazard is the situation when two instructions needs the use of a given hardware resource at the similar time. The most common case in whic

Difference between absolute and relative path, What is the difference betwe...

What is the difference between absolute and relative path name of a file? Absolute path name: This is listing of the directories and files from the root directory to the i

How do active web pages work, How do active web pages work? Describe with a...

How do active web pages work? Describe with a small example. Active Web Pages: An active document is not completely specified through the server. Instead an active documen

Define secondary memory, Define secondary memory. This memory holds tho...

Define secondary memory. This memory holds those pages that are not present in main memory. The secondary memory is usually a high speed disk. It is known as the swap evice, an

Explain the hamiltonian path, What is Hamiltonian path?  A Hamiltonian ...

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where

Neural networks as perceptrons, Neural networks as perceptrons: Howeve...

Neural networks as perceptrons: However ANNs look like this in the general case:  Considered that the w, x, y and z represent real valued weights so all the edges in t

Explain circuit switching versus packet switching, Explain difference of Ci...

Explain difference of Circuit switching versus Packet switching. Within circuit switching an end-to-end path is to be establishing before any data can be sent. Previously a con

Break keys, Like a normal read, your input should break on the new line cha...

Like a normal read, your input should break on the new line character "\n"   and also on the up and down arrow keys. You will process the input made by the user when he/she enters

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