The congenial talking philosophers problem in computer networks

DOI10.1007/s004460100069zbMath1448.68120OpenAlexW2083454577MaRDI QIDQ5138378

Yuh-Jzer Joung

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/84983

zbMATH Keywords

resource allocationdistributed algorithmsmessage passingmutual exclusiongroup mutual exclusion

Mathematics Subject Classification ID

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

Related Items

A token-based solution to group local mutual exclusion problem in mobile ad hoc networks

Cites Work

• Unnamed Item
• Unnamed Item
• A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems
• A taxonomy of distributed mutual exclusion
• A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
• Distributed algorithms for multiple entries to a critical section with priority
• A simple local-spin group mutual exclusion algorithm
• How to assign votes in a distributed system
• Time, clocks, and the ordering of events in a distributed system
• Communicating sequential processes
• Asynchronous group mutual exclusion
• Local-Spin Group Mutual Exclusion Algorithms