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

DOI10.3390/A10020038zbMATH Open1461.68254OpenAlexW2598798591MaRDI QIDQ1662701FDOQ1662701

Authors: Sayaka Kamei, Hirotsugu Kakugawa 

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

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

Recommendations

• Self-stabilizing distributed algorithm for local mutual inclusion
• On the family of critical section problems
• Fault-tolerant critical section management in asynchronous environments
• A new solution to the critical section problem
• Symmetric and economical solutions to the mutual exclusion problem in a distributed system

zbMATH Keywords

mutual exclusioncritical sectionmutual inclusion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• A distributed critical section protocol for general topology
• Another distributed algorithm for multiple entries to a critical section
• Fault-tolerant critical section management in asynchronous environments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662701)