On the Complexity of Certified Write All Algorithms
J. Algorithms, pp. 368-379, 1992.
An Asynchronous PRAM allows processors to run at different and unpredictable speeds. Thus a fundamental problem in designing asynchronous PRAM algorithms is constructing a synchronization primitive which determines that a set of tasks has been completed. The Certified Write All Problem (CWA) is: given an array A[1..n] and a flag f which a...More
PPT (Upload PPT)