Randomized registers and iterative algorithms

Distributed Computing

Volumn 17, Issue 3, 2005, Pages 209-221

  Lee, Hyunyoung ^a   Welch, Jennifer L ^b  

^a University of Denver   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Distributed shared memory; Iterative algorithms; Probabilistic quorums; Randomization; Registers

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; ITERATIVE METHODS; PROBABILITY; PROBLEM SOLVING; WIDE AREA NETWORKS;

DISTRIBUTED SHARED MEMORY; ITERATIVE ALGORITHMS; PROBABILISTIC QUORUMS; RANDOMIZATION; RIGISTERS;

ALGORITHMS;

EID: 17044394430     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-004-0106-3     Document Type: Article

References (29)

1. Adve S, Hill M: Weak ordering - a new definition. In: Proceedings of the 17th Annual International Symposium on Computer Architecture 1990, pp2-14
2. Afek Y, Greenberg D, Merritt M, Taubenfeld G: Computing with Faulty Shared Objects. J. ACM 42(6), 1231-1274 (1995)
3. Ahamad M, Burns JE, Hutto PW, Neiger G: Causal Memory. In : Proceedings of the 5th International Workshop on Distributed Algorithms, Oct. 1991, pp9-30
4. Attiya H, Chaudhuri S, Friedman R, Welch J: Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. SIAM J. Computing 27(1), 65-89 (1998)
5. Attiya H, Friedman R: A Correctness Condition for High-Performance Multiprocessors. In: Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp679-690
6. Bertsekas D: Distributed Asynchronous Computation of Fixed Points. Mathematical Programming 27, 107-120 (1983)
7. Bertsekas D, Tsitsiklis, J: Parallel and Distributed Computation. Prentice-Hall Inc., Englewood Cliffs, NJ, 1989
8. Chazan D, Miranker W: Chaotic relaxation. Linear Algebra and Its Applications 2, 199-222 (1969)
9. Czumaj A, Meyer auf der Heide F, Stemann V: Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 137, 103-120 (1997)
10. Gupta R, Smolka S, Bhaskar S: On Randomization in Sequential and Distributed Algorithms. ACM Computing Surveys 26(1 ), 7-86 (1994)
11. Herlihy MP, Wing JM: Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. Program. Lang. Syst. 12(3), 463-492 (1990)
12. Jayanti P, Chandra T, Toueg S: Fault-tolerant wait-free shared objects. J. ACM 45(3), 451-500 (1998)
13. Lamport L: How to Make a Multiprocessor that Correctly Executes Multiprocess Programs. IEEE Trans. Comput. C-28(9), 690-691 (1979)
14. Lamport L: On Interprocess Communication, Part I: Basic Formalism. Distributed Computing 1(2), 77-85 (1986)
15. Lamport L: On Interprocess Communication, Part II: Algorithms. Distributed Computing 1(2), 86-101 (1986)
16. Lee H: Programs to compute the probability distribution of out-datedness for the probabilistic quorum implementation. Available from http://www.cs.du. edu/~hlee/Research/Programs/
17. Lee H, Welch JL: Randomized Shared Queues Applied to Distributed Optimization Algorithms. In: Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC 2001), Dec. 2001, pp 587-598
18. Malkhi D, Reiter M: Byzantine quorum systems. Distributed Computing 11(4), 203-213 (1998)
19. Malkhi D, Reiter MK, Wool A, Wright RN: probabilistic quorum systems. Information and Computation 170, 184-206 (2001)
20. Motwani R, Raghavan P: Randomized Algorithms, Cambridge University Press, 1995
21. Naor M, Wool A: The load, capacity and availability of quorum systems. SIAM J. Computing 27(2), 423-447 (1998)
22. Peleg D, Wool A: The availability of quorum systems. Information and Computation 123(2), 210-233 (1995)
23. Shavit N, Zemach A: Diffracting trees. ACM Trans, on Computer Systems 14(4), 385-428 (1996)
24. Shavit N, Zemach A: Combining funnels. In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, 1998, pp61-70
25. Shiryayev AN: Probability. Springer-Verlag, 1984
26. Szpankowski W, Rego V: Yet another application of a binomial recurrence: order statistics. Computing 43, 401-410 (1990)
27. Üresin A, Dubois M: Parallel asynchronous algorithms for discrete data. ACM J. 37(3), 558-606 (1990)
28. Üresin A, Dubois M: Effects of asynchronism on the convergence rate of iterative algorithms. J. Parallel and Distributed Computing 34, 66-81 (1996)
29. Yu H: Overcoming the Majority Barrier in Large-scale Systems. In: Proceedings of the 17th International Conference on Distributed Computing, 2003, pp 352-366