This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the Seventh ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 291–302, August 1988.
M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts. A theory of competitive analysis for distributed algorithms. In Proc. 35th Symp. of Foundations of Computer Science, pages 401–411, 1994.
R. Anderson and H. Woll. Wait-free parallel algorithms for the union-find problem. In Proc. 23rd ACM Symposium on Theory of Computing, pages 370–380, 1991.
J. Aspnes and W. Hurwood. Spreading rumors rapidly despite an adversary. In Proc. 15th ACM Symposium on Principles of Distributed Computing, pages 143–151, 1996.
J. Aspnes and O. Waarts. Modular competitiveness for distributed algorithms. In Proc. 28th ACM Symposium on the Theory of Computing, pages 237–246, 1996.
H. Attiya and O. Rachman. Atomic snapshots in o(n log n) operations. In Proc. 12th ACM Symposium on Principles of Distributed Computing, pages 29–40, 1993.
Y. Aumann. Efficient asynchronous consensus with the weak adversary scheduler. In Proc. 16th ACM Symposium on Principles of Distributed Computing, 1997.
Y. Aumann and M.A. Bender. Efficient asynchronous consensus with the valueoblivious adversary scheduler. In Proc. 23rd International Colloquium on Automata, Languages, and Programming, 1996.
S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. In Proc. 22nd Symposium on Theory of Algorithms, pages 379–386, 1990.
T. Chandra. Polylog randomized wait-free consensus. In Proc. 15th ACM Symposium on Principles of Distributed Computing, 1996.
B. Chor, A. Israeli, and M. Li. Wait-free consensus using asynchronous hardware. SIAM J. Comput., 23(4):701–712, August 1994. Preliminary version appears in Proceedings of the 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 86–97, 1987.
S. Even and B. Monien. On the number of rounds needed to disseminate information. In Proc. 1st ACM Symposium on Parallel Algorithms and Architectures, 1989.
M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124–149, January 1991.
E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proc. 25th Symposium on Foundations of Computer Science, pages 394–400, 1994.
B. Patt-Shamir and S. Rajsbaum. A theory of clock synchronization. In Proc. 26th ACM Symposium on the Theory of Computing, pages 810–819, 1994.
M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus — making resilient algorithms fast in practice. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 351–362, 1991.
D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aspnes, J. (1998). Competitive analysis of distributed algorithms. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029567
Download citation
DOI: https://doi.org/10.1007/BFb0029567
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64917-5
Online ISBN: 978-3-540-68311-7
eBook Packages: Springer Book Archive