Self-Stabilizing Wavelets and r-Hops Coordination

Details Self-Stabilizing Wavelets and r-Hops Coordination Self-Stabilizing Wavelets and r-Hops Coordination

2007-06-27

arxiv.org/abs/0706.4015v1

Rapport Interne (01/04/2007)

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underlying structure and works in arbritrary anonymous networks, i.e., no process identifier is required. Moreover, our solution works under any (even unfair) daemon. Next, we use the wavelet scheme to design self-stabilizing layer clocks. We show that they provide an efficient device in the design of local coordination problems at distance r, i.e., r-barrier synchronization and r-local resource allocation (LRA) such as r-local mutual exclusion (LME), r-group mutual exclusion (GME), and r-Reader/Writers. Some solutions to the r-LRA problem (e.g., r-LME) also provide transformers to transform algorithms written assuming any r-central daemon into algorithms working with any distributed daemon.

Affiliated with

Also associated with

No associations

Rating

Self-Stabilizing Wavelets and r-Hops Coordination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Stabilizing Wavelets and r-Hops Coordination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Stabilizing Wavelets and r-Hops Coordination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255866