A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm
From MaRDI portal
Publication:4432745
Recommendations
Cites work
- Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
- scientific article; zbMATH DE number 2036575 (Why is no real title available?)
- Self-stabilizing systems in spite of distributed control
- Time, clocks, and the ordering of events in a distributed system
Cited in
(12)- A token based \(k\)-resilient mutual exclusion algorithm for distributed systems
- Request-based token passing for self-stabilizing mutual exclusion
- Self-stabilizing k-out-of- exclusion in tree networks
- A multiple random walks based self-stabilizing \(k\)-exclusion algorithm in ad hoc networks
- scientific article; zbMATH DE number 2036575 (Why is no real title available?)
- scientific article; zbMATH DE number 2061543 (Why is no real title available?)
- scientific article; zbMATH DE number 1796997 (Why is no real title available?)
- Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
- scientific article; zbMATH DE number 2090634 (Why is no real title available?)
- scientific article; zbMATH DE number 7561459 (Why is no real title available?)
- Self-stabilizing \(\ell\)-exclusion
- Space and time efficient self-stabilizing \(\ell\)-exclusion in tree networks
This page was built for publication: A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432745)