An asynchronous message-passing distributed algorithm for the generalized local critical section problem

DOI10.3390/A10020038zbMath1461.68254OpenAlexW2598798591MaRDI QIDQ1662701

Hirotsugu Kakugawa, Sayaka Kamei

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10020038

zbMATH Keywords

mutual exclusioncritical sectionmutual inclusion

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• On the family of critical section problems
• An implementation of mutual inclusion
• A generalized grid quorum strategy for \(k\)-mutual exclusion in distributed systems
• Time, clocks, and the ordering of events in a distributed system
• Self-stabilizing \(\ell\)-exclusion

This page was built for publication: An asynchronous message-passing distributed algorithm for the generalized local critical section problem