Efficient multi-word locking using randomization

DOI10.1145/1073814.1073862zbMath1314.68379OpenAlexW2042906178MaRDI QIDQ5177246

Philippas Tsigas, Mirjam Wattenhofer, Roger Wattenhofer, Phuong Hoai Ha

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073862

zbMATH Keywords

randomizationshared memorydining philosophersmulti-word locking

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20) Theory of operating systems (68N25) Distributed algorithms (68W15)

Related Items (2)

Built-in coloring for highly-concurrent doubly-linked lists ⋮ Highly concurrent multi-word synchronization

This page was built for publication: Efficient multi-word locking using randomization