Token-based self-stabilizing uniform algorithms

DOI10.1006/JPDC.2001.1832MaRDI QIDQ701148zbMATH OpenOpenAlexFDO

Authors J. Beauquier, Maria Gradinariu, Colette Johnen, Jérôme O. Durand-Lose

Publication date 16 October 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2001.1832

zbMATH Keywords

distributed systemsself-stabilizing algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 1304100
• scientific article; zbMATH DE number 871956
• Self-Stabilizing Symmetry Breaking in Constant Space
• Self-stabilizing token circulation in uniform networks
• Self-stabilizing token circulation on asynchronous uniform unidirectional rings

Cited in

(11)

• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Self-stabilizing token circulation on asynchronous uniform unidirectional rings
• Randomized dining philosophers without fairness assumption
• Randomized self-stabilizing leader election in preference-based anonymous trees
• scientific article; zbMATH DE number 7561459 (Why is no real title available?)
• Self-stabilizing multi-token rings
• A multiple random walks based self-stabilizing \(k\)-exclusion algorithm in ad hoc networks
• Constant-space self-stabilizing token distribution in trees
• Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon
• Self-stabilizing token circulation in uniform networks
• Randomized uniform self-stabilizing mutual exclusion

This page was built for publication: Token-based self-stabilizing uniform algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701148)