Name
Abstract | ||
|---|---|---|
A snap-stabilizingprotocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks. In this protocol, a wave of computation is initiated by the root. In this wave, all the processors are sequentially visited in depth-first search order. After the end of the visit, the root eventually detects the termination of the process. Furthermore, our protocol is proven assuming an unfair daemon, i.e., assuming the weakest scheduling assumption. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1093/comjnl/bxh154 | The Computer Journal |
Keywords | Field | DocType |
arbitrary networks,preliminary version,arbitrary rooted network,arbitrary initial configuration,snap-stabilizing depth-first search,weakest scheduling assumption,unfair daemon,snap-stabilizing protocol,international conference,snap-stabilizing depth-first search wave,distributed system,depth first search,fault tolerance,distributed systems,fault tolerant | Computer science,Scheduling (computing),Breadth-first search,Real-time computing,Fault tolerance,Transmission protocol,Daemon,Communications protocol,Distributed computing,Computation | Journal |
Volume | Issue | ISSN |
49 | 3 | 0010-4620 |
Citations | PageRank | References |
6 | 0.47 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alain Cournier | 1 | 281 | 22.07 |
| Stéphane Devismes | 2 | 192 | 25.74 |
| Franck Petit | 3 | 736 | 60.02 |
| Vincent Villain | 4 | 544 | 45.77 |