The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
ISBN: 978-1-4244-1693-6
pp: 1-8
Franck Petit , MIS / Université de Picardie Jules Verne, Amiens, France
Christian Boulinier , MIS / Université de Picardie Jules Verne, Amiens, France
ABSTRACT
In this paper, we first introduce a simple tool called the wavelet or ϱ-wavelet scheme. Wavelets deal with coordination among processes which are at most ϱ hops away of each other. We propose a self-stabilizing solution for this scheme. Our solution requires no underlying structure and works in arbitrary anonymous settings, i.e., where process identifiers are not required. We show that our solution provides a simple and generic self-stabilizing ϱ-infimum computation. Next, we present a self-stabilizing ϱ-barrier synchronization protocol based on the wavelet scheme. We show that our protocol provides an efficient device in the design of local coordination problems at distance ϱ, such as the ϱ-Local Resource Allocation (LRA). In particular, we propose a solution for the popular ϱ-Local Mutual Exclusion (LME) problem. The solution to ϱ-LME also provides a transformer to transform algorithms written under ϱ-central daemon into algorithms working with any distributed daemon.
INDEX TERMS
CITATION
Franck Petit, Christian Boulinier, "Self-stabilizing wavelets and ?-hops coordination", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-8, 2008, doi:10.1109/IPDPS.2008.4536130
98 ms
(Ver 3.3 (11022016))