It is one of the models based on PRAM. In this model, the processors access the memory locations concurrently for reading as well as writing operations. In the algorithm, which uses CRCW model of computation, n3 number of processors is employed. Whenever a concurrent write operation is executed on a specific memory location, say m, than there are chances of happening of a conflict. Thus, the write conflicts i.e. (WR, RW, and WW) have been determined in the following manner. In a condition when more than one processor tries to write on the similar memory location, the bit stored in the memory location is always the sum of the values computed by the a variety of 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).