Charles E. Leiserson and Keith H. Randall. Parallel algorithms for the circuit value update problem. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, California, July 1995. To appear. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
An Optimistic, Parallel Algorithm for the Circuit Value Update.. - Randall (1995) (Correct)
....and suppose that W and D are the size and embedded depth, respectively, of the volatile subcircuit. Then, for all ffl 0, the probability is at most ffl that the optimistic algorithm runs in more than O(W=P D lg W lg P lg(1=ffl) time. Proof. For a complete proof, we refer the reader to [4]. Our optimistic, asynchronous, parallel algorithm is a simple and natural generalization of the serial algorithm, and we find it remarkable that it works as well as it does. To our knowledge, our analysis provides the first analytical bounds on the running time of an optimistic, asynchronous ....
Charles E. Leiserson and Keith H. Randall. Parallel algorithms for the circuit value update problem. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, California, July 1995. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC