loading...
Snap-Stabilizing PIF and Useless Computations
Minneapolis, Minnesota July 12-July 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPADS.2006.10012th International Conference on Para ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Alain Cournier, Stephane Devismes, Vincent Villain, "Snap-Stabilizing PIF and Useless Computations," Parallel and Distributed Systems, International Conference on, vol. 1, pp. 39-48, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICPADS.2006.100,
author = {Alain Cournier and Stephane Devismes and Vincent Villain},
title = {Snap-Stabilizing PIF and Useless Computations},
journal ={Parallel and Distributed Systems, International Conference on},
volume = {1},
year = {2006},
issn = {1521-9097},
pages = {39-48},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPADS.2006.100},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Systems, International Conference on
TI - Snap-Stabilizing PIF and Useless Computations
SN - 1521-9097
SP39
EP48
A1 - Alain Cournier,
A1 - Stephane Devismes,
A1 - Vincent Villain,
PY - 2006
KW - null
VL - 1
JA - Parallel and Distributed Systems, International Conference on
ER -
 
Alain Cournier, Universite de Picardie Jules Verne, France
Stephane Devismes, Universite de Picardie Jules Verne, France
Vincent Villain, Universite de Picardie Jules Verne, France
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 time unit. Here, we propose the first snap-stabilizing propagation of information with feedback for arbitrary networks working with an unfair daemon. An interesting aspect of our solution is that, starting from any configuration, the number of reception (resp. acknowledgement) of corrupted messages (i.e., messages not initiated by the root) by a processor is bounded.
Citation:
Alain Cournier, Stephane Devismes, Vincent Villain, "Snap-Stabilizing PIF and Useless Computations," icpads, vol. 1, pp.39-48, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.