SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS

DOI10.1142/S0129054111008283zbMath1216.68054OpenAlexW2032876934MaRDI QIDQ2997926

Lawrence L. Larmore, Stéphane Devismes, Ajoy K. Datta, Florian Horn

Publication date: 10 May 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008283

zbMATH Keywords

resource allocationfault-toleranceself-stabilization\(k\)-out-of-\(\ell \) exclusionoriented tree networks

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
• Self-stabilizing extensions for message-passing systems
• Self-stabilizing systems in spite of distributed control
• A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm
• Self-Stabilization by Counter Flushing

This page was built for publication: SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS