Asynchronous group mutual exclusion

DOI10.1007/PL00008918MaRDI QIDQ5137904zbMATH OpenOpenAlexFDO

Authors Yuh-Jzer Joung

Publication date 3 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00008918

zbMATH Keywords

congenial talking philosophersgroup mutual exclusionmutual exclusionresource allocationshared-memory algorithms

Mathematics Subject Classification ID

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

Recommendations

• The congenial talking philosophers problem in computer networks
• Group mutual exclusion algorithms based on ticket orders
• A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
• Local-Spin Group Mutual Exclusion Algorithms
• Fair group mutual exclusion

Cites work

• Concurrent Reading While Writing
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• scientific article; zbMATH DE number 47171 (Why is no real title available?)
• scientific article; zbMATH DE number 3601088 (Why is no real title available?)
• scientific article; zbMATH DE number 571325 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• Locking Primitives in a Database System
• Myths about the mutual exclusion problem
• The notions of consistency and predicate locks in a database system
• The serializability of concurrent database updates
• Universal constructions for multi-object operations

Cited in

(14)

• Space-efficient FCFS group mutual exclusion
• A token-based solution to group local mutual exclusion problem in mobile ad hoc networks
• Group mutual exclusion in linear time and space
• A visit to mutual exclusion in seven dates
• A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
• Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem
• scientific article; zbMATH DE number 1728280 (Why is no real title available?)
• Asynchronous exclusive selection
• Group mutual exclusion algorithms based on ticket orders
• scientific article; zbMATH DE number 2006641 (Why is no real title available?)
• The congenial talking philosophers problem in computer networks
• Shared-memory mutual exclusion: major research trends since 1986
• Local-Spin Group Mutual Exclusion Algorithms
• Real-time multiprocessor locks with nesting: optimizing the common case

Describes a project that uses

Uses Software

• UNITY

This page was built for publication: Asynchronous group mutual exclusion

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