The class NC of efficiently parallelizable problems | Scalable Computing | Part 12 | SC

Let P be an algorithm for solving a problem П on CRCW-PRAM(p).
According to Theorem 2.1, the execution of P on EREW-PRAM(p) will be at most O(log p) times slower than on CRCW-PRAM(p).