Distributed algorithms for multiple entries to a critical section with priority
From MaRDI portal
Recommendations
- A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
- scientific article; zbMATH DE number 1728280
- Mutual exclusion as a matter of priority
- A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
- Info-based approach in distributed mutual exclusion algorithms
Cites work
- A class of deadlock-free Maekawa-type algorithms for mutual exclusion in distributed systems
- Another distributed algorithm for multiple entries to a critical section
- scientific article; zbMATH DE number 3970080 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- Time, clocks, and the ordering of events in a distributed system
Cited in
(7)- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
- Another distributed algorithm for multiple entries to a critical section
- \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem
- scientific article; zbMATH DE number 1728280 (Why is no real title available?)
- scientific article; zbMATH DE number 1756660 (Why is no real title available?)
- A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
- The congenial talking philosophers problem in computer networks
This page was built for publication: Distributed algorithms for multiple entries to a critical section with priority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327307)
