Computing with Reads and Writes in the Absence of Step Contention-Reference-Cited by-同舟云学术

Computing with Reads and Writes in the Absence of Step Contention

Published:2005 Issue: Volume: Page:122-136
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Attiya Hagit,Guerraoui Rachid,Kouznetsov Petr

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11561927_11

Reference26 articles.

1. Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 262–272 (1999)

2. Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive splitter and applications. Distributed Computing 15(2), 67–86 (2002)

3. Aguilera, M.K., Frølund, S.: Strict linearizability and the power of aborting. Technical report, HP Laboratories Palo Alto (2003)

4. Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. J. Algorithms 11(3), 441–461 (1990)

5. Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 444–468 (2003)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Agreeing within a few writes;Theoretical Computer Science;2022-06

2. The computational structure of progress conditions and shared objects;Distributed Computing;2019-06-19

3. Lock-free Concurrent Data Structures and How to Model their Performance;2019 19th International Conference on Application of Concurrency to System Design (ACSD);2019-06

4. Revisionist Simulations;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23

5. Contention-sensitive data structures and algorithms;Theoretical Computer Science;2017-05