Scalable eventually consistent counters over unreliable networks-Reference-Cited by-同舟云学术

Scalable eventually consistent counters over unreliable networks

Published:2017-12-19 Issue:1 Volume:32 Page:69-89
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Almeida Paulo Sérgio^ORCID,Baquero Carlos^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00446-017-0322-2/fulltext.html

Reference33 articles.

1. Ascó, A.: SyncFree: WP1 deliverable. In: Application and Environment Requirements. https://syncfree.lip6.fr/attachments/article/46/d1_1.pdf , (2015)

2. Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM 41(5), 1020–1048 (1994)

3. Attiya, H., Dolev, S., Welch, J.L.: Connection management without retaining information. In: Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, vol. 2, pp. 622–631. (1995)

4. Lecture Notes in Computer Science;H Attiya,1994

5. Brewer, E.A.: Towards robust distributed systems (abstract). In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, PODC ’00, p. 7, New York (2000)

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

1. Approaches to Conflict-free Replicated Data Types;ACM Computing Surveys;2024-09-09

2. Resilient Conflict-free Replicated Data Types without Atomic Broadcast;Proceedings of the 17th International Conference on Software Technologies;2022