Concurrently read concurrently write, Computer Engineering

Assignment Help:

Q. Concurrently read concurrently write?

It is one of the models derived from PRAM. In this model the processors access the memory locations simultaneously for reading and writing operations. In this algorithm that uses CRCW model of computation, n3 number of processors is used. Whenever a simultaneous write operation is executed on a particular memory location let's say m than there are odds of occurrence of a conflict. So the write conflicts it implies that (WR, RW, WW) have been resolved in the subsequent manner. In a condition when more than one processor attempts to write on same memory location, the value stored in memory location is always the sum of values computed by different processors.

Algorithm Matrix Multiplication using CRCW

Input// Two Matrices M1 and M2

For I=1 to n                                  //Operation performed in PARALLEL

      For j=1 to n                          //Operation performed in PARALLEL 

         For k=1 to n                    //Operation performed in PARALLEL

               Oij = 0;

               Oij = M1ik * M2kj

               End For

       End For 

End For

The complexity of CRCW based algorithm is O(1).


Related Discussions:- Concurrently read concurrently write

Networking, how to connect a home network

how to connect a home network

Switch statement with the use of nested if-else statement, Compare the use ...

Compare the use of switch statement with the use of nested if-else statement. If-else statement:  When there are many conditional statements that may all evaluate to true, bu

Electric circuit analysis, mmmmmmmmmmmmm mmmmmmm s s s s s s s s s d d d ...

mmmmmmmmmmmmm mmmmmmm s s s s s s s s s d d d d d d d d d d d d d d f f ff g gg g g g g gg r r r rr r w ww w w ww w w

Factor causing parallel overheads, Performance metrics aren't able to attai...

Performance metrics aren't able to attain a linear curve in comparison to increase in number of processors in parallel computer. The main reason for above situation is presence of

What are two reasons for using layered protocol, What are two reasons for u...

What are two reasons for using layered protocol? Layered protocol implies protocols used into each layer are the layer's own business that is they don't influence protocol of a

What is stack addressing, Q. What is Stack Addressing? In this addressi...

Q. What is Stack Addressing? In this addressing technique operand is implied as top of stack. It isn't explicit however implied. It employs a CPU Register known as Stack Pointe

8086, the block diagram of an 8086 processor

the block diagram of an 8086 processor

What are the end-to-end layers of osi structure, What are the end-to-end la...

What are the end-to-end layers of OSI structure? The layers 4 to 7 of ISO-OSI reference model communicate along with peer entities into the end systems. Now here is no communi

Define deadlock, Define deadlock. A process requests resources; if the ...

Define deadlock. A process requests resources; if the resources are not available at that time, the method enters a wait state. Waiting processes might never again change state

What is a heap, What is a heap? The heap is an area of memory that is ...

What is a heap? The heap is an area of memory that is dynamically allocated. As a stack, this may grow and shrink throughout runtime. Not like a stack, a heap is not LIFO show

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