Scalable Self-Stabilization
β Scribed by Sukumar Ghosh; Xin He
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 232 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper presents a methodology for a synchronous non-reactive distributed system on a tree topology to stabilize from a k-faulty configuration in a time independent of the size n of the system. In the proposed methodology, processes first measure and compare the sizes of the faulty regions, and then use this information to schedule actions in such a way that the size of the faulty regions progressively shrink, until they completely disappear. We demonstrate that when k processes fail, the stabilization time is OΓ°k 2 Γ. Apart from its applicability to a wide class of problems, the proposed method achieves scalability with a low space complexity of OΓ°D:Γ°D:k ΓΎ log 2 nΓΓ per process, where D is the maximum degree of a node. # 2002 Elsevier Science (USA)
π SIMILAR VOLUMES
Self-stabilizing protocols can resist transient failures and guarantee system recovery in a ΓΏnite time. We highlight the connexion between the formalism of self-stabilizing distributed systems and the formalism of generalized path algebra and asynchronous iterations with delay. We use the later to p
This study is concerned with synaptic reorganization in local neuronal networks. Within networks of 30 neurons, an initial disequilibrium in connectivity has to be compensated by reorganization of synapses. Such plasticity is not a genetically determined process, but depends on results of neuronal i