Group mutual exclusion in linear time and space

DOI10.1016/J.TCS.2017.05.030zbMath1382.68030arXiv1403.5605OpenAlexW2951487871MaRDI QIDQ1686110

Peng Zhang

Publication date: 20 December 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.5605

zbMATH Keywords

mutual exclusiongroup mutual exclusionblack and white bakery algorithmLamport's bakery algorithmremote memory reference complexity

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

Group mutual exclusion in linear time and space

Cites Work

• Unnamed Item
• Group mutual exclusion in linear time and space
• A simple local-spin group mutual exclusion algorithm
• Fair group mutual exclusion
• Group Mutual Exclusion Algorithms Based on Ticket Orders
• A new solution of Dijkstra's concurrent programming problem
• A fast, scalable mutual exclusion algorithm
• Asynchronous group mutual exclusion
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• Local-Spin Group Mutual Exclusion Algorithms
• The mutual exclusion problem

This page was built for publication: Group mutual exclusion in linear time and space