论文信息 - Non-Adaptive Algorithms For The Write-All Problem - 字舞流文

Non-Adaptive Algorithms For The Write-All Problem

Yoav Freund | Y. Freund

[1] G. Szekeres,et al. A combinatorial problem in geometry , 2009 .

[2] Dariusz R. Kowalski,et al. Writing-all deterministically and optimally using a nontrivial number of asynchronous processors , 2008, ACM Trans. Algorithms.

[3] Chryssis Georgiou,et al. Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity , 2007 .

[4] Alexander Russell,et al. The Complexity of Synchronous Iterative Do-All with Crashes , 2001, DISC.

[5] Richard J. Anderson,et al. Algorithms for the Certified Write-All Problem , 1997, SIAM J. Comput..

[6] Prabhakar Ragde,et al. Parallel Algorithms with Processor Failures and Delays , 1996, J. Algorithms.

[7] Alexander A. Shvartsman. Achieving Optimal CRCW PRAM Fault-Tolerance , 1991, Inf. Process. Lett..

[8] Z. M. Kedem,et al. Combining tentative and definite executions for very fast dependable parallel computing , 1991, STOC '91.

[9] R. Subramonian,et al. Asynchronous PRAMs are (almost) as good as synchronous PRAMs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10] Alexander A. Shvartsman,et al. Efficient parallel algorithms can be made robust , 1989, PODC '89.

[11] Steven Fortune,et al. Parallelism in random access machines , 1978, STOC.