Self-Stabilization by Counter Flushing

DOI10.1137/S009753979732760XMaRDI QIDQ4507361zbMATH OpenOpenAlexFDO

Authors George Varghese

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753979732760x

zbMATH Keywords

distributed algorithmsself-stabilization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Parallel algorithms in computer science (68W10)

Recommendations

• Self-stabilization over unreliable communication media
• Universal dynamic synchronous self-stabilization
• Self-stabilization with path algebra
• Self-stabilization
• Self-stabilization of dynamic systems assuming only read/write atomicity

Cited in

(11)

• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Stabilizing data-link over non-FIFO channels with optimal fault-resilience
• Self-stabilizing k-out-of- exclusion in tree networks
• A multiple random walks based self-stabilizing \(k\)-exclusion algorithm in ad hoc networks
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Self-stabilizing systems in spite of high dynamics
• Reducing the number of messages in self-stabilizing protocols
• Resource efficient stabilization for local tasks despite unknown capacity links
• Snap-stabilization in message-passing systems
• Flush primitives for asynchronous distributed systems

This page was built for publication: Self-Stabilization by Counter Flushing

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