Document Open Access Logo

Brief Announcement: Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph

Authors Denis Korotchenko , Vitaly Aksenov

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2026.57.pdf
  • Filesize: 0.77 MB
  • 7 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Concurrency
  • Theory of computation → Shared memory algorithms
  • Computing methodologies → Parallel algorithms
Keywords
  • Concurrency
  • Conflict Graph
  • Locks
  • Linearizability
  • Concurrent Data Structures

Metrics

Abstract

This paper presents a new lock, SemanticLock, based on the conflict graph between operations. We can consider it a generalization of a read-write lock where conflicts exist between write operations and all other operations.
We demonstrate the effectiveness of our lock in two applications. In the first, we design a toy data structure: an array supporting point queries and different range queries. In the second, potentially of greater interest, we augment an existing concurrent data structure, ConcurrentHashMap, with additional long-running operations.

Cite As Get BibTex

Denis Korotchenko and Vitaly Aksenov. Brief Announcement: Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph. In 40th International Symposium on Distributed Computing (DISC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 397, pp. 57:1-57:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.DISC.2026.57

Author Details

Denis Korotchenko
  • ITMO University, St. Petersburg, Russia
Vitaly Aksenov
  • ITMO University, St. Petersburg, Russia

References

  1. Vitaly Aksenov, Petr Kuznetsov, and Anatoly Shalyto. Parallel Combining: Benefits of Explicit Synchronization. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018), volume 125 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1-11:16, Dagstuhl, Germany, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2018.11.
  2. B. R. Badrinath and Krithi Ramamritham. Semantics-based concurrency control: Beyond commutativity. ACM Trans. Database Syst., 17(1):163-199, 1992. URL: https://doi.org/10.1145/128765.128771.
  3. Guy E. Blelloch and Yuanhao Wei. Verlib: Concurrent versioned pointers. In Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP '24, pages 200-214, New York, NY, USA, 2024. Association for Computing Machinery. URL: https://doi.org/10.1145/3627535.3638501.
  4. Trevor Brown, Aleksandar Prokopec, and Dan Alistarh. Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '20, pages 276-291, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3332466.3374542.
  5. P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with “readers” and “writers”. Commun. ACM, 14(10):667-668, October 1971. URL: https://doi.org/10.1145/362759.362813.
  6. Vincent Gramoli. More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms. In Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2015, pages 1-10, New York, NY, USA, 2015. Association for Computing Machinery. URL: https://doi.org/10.1145/2688500.2688501.
  7. Danny Hendler, Itai Incze, Nir Shavit, and Moran Tzafrir. Flat combining and the synchronization-parallelism tradeoff. In Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 355-364, June 2010. URL: https://doi.org/10.1145/1810479.1810540.
  8. Maurice Herlihy and Eric Koskinen. Transactional boosting: a methodology for highly-concurrent transactional objects. In Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '08, pages 207-216, New York, NY, USA, 2008. Association for Computing Machinery. URL: https://doi.org/10.1145/1345206.1345237.
  9. 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.
  10. Yuh-Jzer Joung. Asynchronous group mutual exclusion (extended abstract). In Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC '98, pages 51-60, New York, NY, USA, 1998. Association for Computing Machinery. URL: https://doi.org/10.1145/277697.277706.
  11. Denis Korotchenko and Vitaly Aksenov. Semantic lock: Synchronization based on the analysis of the operation conflict graph, 2026. URL: https://doi.org/10.48550/arXiv.2606.24250.
  12. Milind Kulkarni, Donald Nguyen, Dimitrios Prountzos, Xin Sui, and Keshav Pingali. Exploiting the commutativity lattice. In ACM SIGPLAN Notices, volume 46, pages 542-555, June 2011. URL: https://doi.org/10.1145/1993498.1993562.
  13. David B. Lomet. Key range locking strategies for improved concurrency. In Proceedings of the 19th International Conference on Very Large Data Bases, VLDB '93, pages 655-664, San Francisco, CA, USA, 1993. Morgan Kaufmann Publishers Inc. URL: http://www.vldb.org/conf/1993/P655.PDF.
  14. Aoxue Luo, Weigang Wu, Jiannong Cao, and Michel Raynal. A generalized mutual exclusion problem and its algorithm. In Proceedings of the International Conference on Parallel Processing, pages 300-309, 2013. URL: https://doi.org/10.1109/ICPP.2013.39.
  15. Aleksandr Potapov, Maksim Zuev, Evgenii Moiseenko, and Nikita Koval. Testing concurrent algorithms on jvm with lincheck and intellij idea. In Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2024, pages 1821-1825, New York, NY, USA, 2024. Association for Computing Machinery. URL: https://doi.org/10.1145/3650212.3685301.
  16. Matthew Rodriguez, Vitaly Aksenov, and Michael Spear. Skip hash: A fast ordered map via software transactional memory. In 2025 IEEE 45th International Conference on Distributed Computing Systems (ICDCS), pages 956-966. IEEE, 2025. URL: https://doi.org/10.1109/ICDCS63083.2025.00097.
  17. Nir Shavit and Dan Touitou. Software transactional memory. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pages 204-213, 1995. URL: https://doi.org/10.1145/224964.224987.
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-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact