next up previous
Next: Up: Previous:

Theorem 30.1 (First Edition)

A p-processor CRCW can be no more than O(lg p) times faster than the best p-processor EREW algorithm for the same problem.



Proof: Simulate each step of CRCW algorithm with a O(lg p) time EREW computation.


next up previous
Next: Up: Previous: