Name
Abstract | ||
|---|---|---|
In this paper, we introduce the notion of gradually stabilizing algorithm as any self-stabilizing algorithm with the following additional feature: if at most $$\\tau $$dynamic steps occur starting from a legitimate configuration, it first quickly recovers to a configuration from which a minimum quality of service is satisfied and then gradually converges to stronger and stronger safety guarantees until reaching a legitimate configuration again. We illustrate this new property by proposing a gradually stabilizing unison algorithm. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-43659-3_43 | Euro-Par |
Field | DocType | Volume |
Topology,Superstabilization,Simulation,Computer science,Unison,Quality of service,Self-stabilization,Distributed computing | Conference | 9833 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karine Altisen | 1 | 165 | 15.03 |
| Stéphane Devismes | 2 | 192 | 25.74 |
| Anaïs Durand | 3 | 10 | 4.29 |
| Franck Petit | 4 | 736 | 60.02 |