Name
Abstract | ||
|---|---|---|
A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. In this paper, we first prove the number of states required on processors to design a snap-stabilizing Propagation of Information with Feedback (PIF) algorithm in un-oriented trees running under any (even unfair) distributed daemon (four states per processor... |
Year | Venue | Field |
|---|---|---|
2001 | OPODIS | Computer science,Snap,Real-time computing,Distributed computing |
DocType | Citations | PageRank |
Conference | 8 | 0.85 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Cournier | 1 | 281 | 22.07 |
| Ajoy Kumar Datta | 2 | 317 | 40.76 |
| Franck Petit | 3 | 736 | 60.02 |
| Vincent Villain | 4 | 544 | 45.77 |