23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings.
Download PDF

Abstract

We present a self-stabilizing algorithm for .nding a generalized maximal matching (b-matching) in an arbitrary distributed network. We show that the algorithm converges in 0(m) moves under an unfair central demon independent of the b-values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!

Related Articles