A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie

DOI10.1016/0020-0190(94)90014-0zbMath0795.68083OpenAlexW2075059249WikidataQ127087499 ScholiaQ127087499MaRDI QIDQ1318744

Masafumi Yamashita, Hirotsugu Kakugawa, Satoshi Fujita, Tadashi Ae

Publication date: 5 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90014-0

zbMATH Keywords

distributed systemsmutual exclusioncoteriecritical section

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (6)

\((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem ⋮ A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems ⋮ On quorum systems for group resources allocation ⋮ \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion ⋮ ModelingK-coteries by well-covered graphs ⋮ The congenial talking philosophers problem in computer networks

Cites Work

• Another distributed algorithm for multiple entries to a critical section
• How to assign votes in a distributed system
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie