Abstract
This paper presents a new transformation which adds fault-containment properties to silent self-stabilizing algorithms. The transformation features a constant slow-down factor and the fault-gap-that is the minimal time between two containable faults-is also constant. The transformation scales well to arbitrarily large systems and avoids global synchronization. The presented transformation is the first with a constant fault-gap and requires no knowledge of the system size.
| Original language | English |
|---|---|
| Pages (from-to) | 207-224 |
| Number of pages | 18 |
| Journal | Distributed Computing |
| Volume | 25 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 2012 |
| Externally published | Yes |
Bibliographical note
Funding Information:This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.
Funding
This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.
| Funders | Funder number |
|---|---|
| Deutsche Forschungsgemeinschaft | TU 221/3-1 |
Keywords
- Fault-containment
- Self-stabilization
- Single transient fault
Fingerprint
Dive into the research topics of 'Fault-containing self-stabilization in asynchronous systems with constant fault-gap'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver