Quasi-self-stabilization of a distributed system assuming read/write atomicity

DOI10.1016/j.camwa.2008.02.052zbMath1165.68321OpenAlexW2091796979MaRDI QIDQ1029860

Cheng-Zen Yang, Tetz C. Huang, Nathan Mou, Ji-Cherng Lin

Publication date: 13 July 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.02.052

zbMATH Keywords

mutual exclusioncomputational modelsread/write atomicityself-stabilizing0-configurationscomposite atomicityquasi-self-stabilizing

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (4)

Loosely-stabilizing leader election in a population protocol model ⋮ Loosely-Stabilizing Leader Election in Population Protocol Model ⋮ Loosely-stabilizing maximal independent set algorithms with unreliable communications ⋮ Optical soliton solutions to the \((2+1)\)-dimensional Chaffee-Infante equation and the dimensionless form of the Zakharov equation

Cites Work

• Unnamed Item
• Unnamed Item
• A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
• A belated proof of self-stabilization
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing depth-first search
• A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
• A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
• Self-stabilizing systems in spite of distributed control

This page was built for publication: Quasi-self-stabilization of a distributed system assuming read/write atomicity