Asynchronous group mutual exclusion

DOI10.1007/PL00008918zbMath1448.68119OpenAlexW2060115171MaRDI QIDQ5137904

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

resource allocationmutual exclusiongroup mutual exclusionshared-memory algorithmscongenial talking philosophers

Mathematics Subject Classification ID

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

Related Items (8)

A visit to mutual exclusion in seven dates ⋮ A token-based solution to group local mutual exclusion problem in mobile ad hoc networks ⋮ Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem ⋮ Group mutual exclusion in linear time and space ⋮ The congenial talking philosophers problem in computer networks ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Space-efficient FCFS group mutual exclusion ⋮ Real-time multiprocessor locks with nesting: optimizing the common case

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Myths about the mutual exclusion problem
• The serializability of concurrent database updates
• Concurrent Reading While Writing
• Locking Primitives in a Database System
• The notions of consistency and predicate locks in a database system
• Universal constructions for multi-object operations

This page was built for publication: Asynchronous group mutual exclusion