Document Open Access Logo

Resolving Conflicts with Grace: Dynamically Concurrent Universality

Authors Petr Kuznetsov , Nathan Josia Schrodt

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.33.pdf
  • Filesize: 1.01 MB
  • 29 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Universal Construction
  • Consensus
  • Dynamic Concurrency

Metrics

Abstract

Synchronization is the major obstacle to scalability in distributed computing. Concurrent operations on the shared data engage in synchronization when they encounter a conflict, i.e., their effects depend on the order in which they are applied. Ideally, one would like to detect conflicts in a dynamic manner, i.e., adjusting to the current system state. Indeed, it is very common that two concurrent operations conflict only in some rarely occurring states. In this paper, we define the notion of dynamic concurrency: an operation employs strong synchronization primitives only if it has to arbitrate with concurrent operations, given the current system state. We then present a dynamically concurrent universal construction.

Cite As Get BibTex

Petr Kuznetsov and Nathan Josia Schrodt. Resolving Conflicts with Grace: Dynamically Concurrent Universality. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 33:1-33:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.33

Author Details

Petr Kuznetsov
  • LTCI, Télécom Paris, Institut Polytechnique de Paris, France
Nathan Josia Schrodt
  • Télécom Paris, Institut Polytechnique de Paris, France
  • Technical University of Darmstadt, Germany

References

  1. Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, September 1993. URL: https://doi.org/10.1145/153724.153741.
  2. Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, and Srivatsan Ravi. Optimal concurrency for list-based sets. In Victor Malyshkin, editor, PaCT, volume 12942 of Lecture Notes in Computer Science, pages 386-401. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-86359-3_29.
  3. J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous pram model. In Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, pages 340-349, New York, NY, USA, 1990. Association for Computing Machinery. URL: https://doi.org/10.1145/97444.97701.
  4. Hagit Attiya, Rachid Guerraoui, Danny Hendler, and Petr Kuznetsov. The complexity of obstruction-free implementations. J. ACM, 56(4):24:1-24:33, 2009. URL: https://doi.org/10.1145/1538902.1538908.
  5. Hagit Attiya and Jennifer L. Welch. Distributed computing - fundamentals, simulations, and advanced topics (2. ed.). Wiley series on parallel and distributed computing. Wiley, 2004. Google Scholar
  6. Rida Bazzi and Maurice Herlihy. Clairvoyant state machine replication. Information and Computation, 285:104701, 2022. URL: https://doi.org/10.1016/J.IC.2021.104701.
  7. Austin T. Clements, M. Frans Kaashoek, Nickolai Zeldovich, Robert T. Morris, and Eddie Kohler. The scalable commutativity rule: designing scalable software for multicore processors. In Michael Kaminsky and Mike Dahlin, editors, SOSP, pages 1-17. ACM, 2013. URL: https://doi.org/10.1145/2517349.2522712.
  8. James A. Cowling, Daniel S. Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira. HQ replication: A hybrid quorum protocol for byzantine fault tolerance. In Brian N. Bershad and Jeffrey C. Mogul, editors, OSDI, pages 177-190. USENIX Association, 2006. URL: http://www.usenix.org/events/osdi06/tech/cowling.html.
  9. Tudor David, Rachid Guerraoui, and Vasileios Trigonakis. Asynchronized concurrency: The secret to scaling concurrent search data structures. In ASPLOS, pages 631-644, 2015. URL: https://doi.org/10.1145/2694344.2694359.
  10. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. JACM, 32(2):374-382, April 1985. URL: https://doi.org/10.1145/3149.214121.
  11. Eli Gafni. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In PODC, pages 143-152, 1998. Google Scholar
  12. Vincent Gramoli, Petr Kuznetsov, and Srivatsan Ravi. In the search for optimal concurrency. In Jukka Suomela, editor, SIROCCO, volume 9988 of Lecture Notes in Computer Science, pages 143-158, 2016. URL: https://doi.org/10.1007/978-3-319-48314-6_10.
  13. Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. The consensus number of a cryptocurrency. In PODC, 2019. URL: https://arxiv.org/abs/1906.05574.
  14. Maryam Helmi, Lisa Higham, and Philipp Woelfel. Strongly linearizable implementations: possibilities and impossibilities. In Darek Kowalski and Alessandro Panconesi, editors, PODC '12, pages 385-394. ACM, 2012. URL: https://doi.org/10.1145/2332432.2332508.
  15. Maurice Herlihy. Wait-free synchronization. ACM Trans. Program. Lang. Syst., 13(1):124-149, 1991. URL: https://doi.org/10.1145/114005.102808.
  16. Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 19-22 May 2003, Providence, RI, USA, pages 522-529. IEEE Computer Society, 2003. URL: https://doi.org/10.1109/ICDCS.2003.1203503.
  17. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, July 1990. URL: https://doi.org/10.1145/78969.78972.
  18. Amos Israeli and Lihu Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '94, pages 151-160, 1994. URL: https://doi.org/10.1145/197917.198079.
  19. Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. All you need is DAG. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, pages 165-175. ACM, 2021. URL: https://doi.org/10.1145/3465084.3467905.
  20. Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: speculative byzantine fault tolerance. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, pages 45-58, 2007. Google Scholar
  21. Milind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui, and Keshav Pingali. Exploiting the commutativity lattice. In Mary W. Hall and David A. Padua, editors, PLDI, pages 542-555. ACM, 2011. URL: https://doi.org/10.1145/1993498.1993562.
  22. Milind Kulkarni, Dimitrios Prountzos, Donald Nguyen, and Keshav Pingali. Defining and implementing commutativity conditions for parallel execution. In Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM, 2009. Google Scholar
  23. Leslie Lamport. The Part-Time parliament. ACM Transactions on Computer Systems, 16(2):133-169, May 1998. URL: https://doi.org/10.1145/279227.279229.
  24. Leslie B Lamport. Generalized paxos, apr13 2010. US Patent 7,698,465. URL: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2005-33.pdf.
  25. Cheng Li, Daniel Porto, Allen Clement, Johannes Gehrke, Nuno M. Preguiça, and Rodrigo Rodrigues. Making geo-replicated systems fast as possible, consistent when necessary. In Chandu Thekkath and Amin Vahdat, editors, 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, October 8-10, 2012, pages 265-278. USENIX Association, 2012. URL: https://www.usenix.org/conference/osdi12/technical-sessions/presentation/li.
  26. M.C. Loui and H.H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163-183, 1987. Google Scholar
  27. Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2008. Google Scholar
  28. Miguel Pires, Srivatsan Ravi, and Rodrigo Rodrigues. Generalized paxos made byzantine (and less complex). Algorithms, 11(9):141, 2018. URL: https://doi.org/10.3390/A11090141.
  29. Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, December 1990. URL: https://doi.org/10.1145/98163.98167.
  30. Alexander Spiegelman, Balaji Arun, Rati Gelashvili, and Zekun Li. Shoal: Improving DAG-BFT latency and robustness. In Jeremy Clark and Elaine Shi, editors, Financial Cryptography and Data Security - 28th International Conference, FC 2024, Willemstad, Curaçao, March 4-8, 2024, Revised Selected Papers, Part I, volume 14744 of Lecture Notes in Computer Science, pages 92-109. Springer, 2024. URL: https://doi.org/10.1007/978-3-031-78676-1_6.
  31. Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. Bullshark: DAG BFT protocols made practical. In Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi, editors, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pages 2705-2718. ACM, 2022. URL: https://doi.org/10.1145/3548606.3559361.
  32. Andrei Tonkikh, Pavel Ponomarev, Petr Kuznetsov, and Yvonne-Anne Pignolet. Cryptoconcurrency: (almost) consensusless asset transfer with shared accounts. In Weizhi Meng, Christian Damsgaard Jensen, Cas Cremers, and Engin Kirda, editors, CCS, pages 1556-1570. ACM, 2023. URL: https://doi.org/10.1145/3576915.3616587.
  33. Gavin Wood. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1-32, 2014. Google Scholar
  34. Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, and Ittai Abraham. Hotstuff: BFT consensus with linearity and responsiveness. In Peter Robinson and Faith Ellen, editors, PODC, pages 347-356. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331591.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact