Abstract
This paper presents a new distributed self-stabilizing algorithm solving the maximal matching problem under the fair distributed daemon. This is the first maximal matching algorithm in the link-register model under read/write atomicity. This work is composed of two parts. As we cannot establish a move complexity analysis under the fair distributed daemon, we first design an algorithm \(\mathcal A_{1} \) under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt \(\mathcal A_{1} \) so that it can handle the fair distributed daemon, leading to the \(\mathcal A_{2} \) algorithm. We prove that algorithm \(\mathcal A_1\) stabilizes in \(O(m\Delta )\) moves and algorithm \(\mathcal A_2\) in \(O(m\Delta )\) rounds, with \(\Delta \) the maximum degree and m the number of edges.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Asada, Y., Inoue, M.: An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 187–198. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-15612-5_17
Berenbrink, P., Friedetzky, T., Martin, R.A.: On the stability of dynamic diffusion load balancing. Algorithmica 50(3), 329–350 (2008)
Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC, pp. 150–159. ACM (2004)
Cantarell, S., Datta, A.K., Petit, F.: Self-stabilizing atomicity refinement allowing neighborhood concurrency. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 102–112. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45032-7_8
Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: PODC, pp. 290–297. ACM (2002)
Cohen, J., Lefevre, J., Maâmra, K., Pilard, L., Sohier, D.: A self-stabilizing algorithm for maximal matching in anonymous networks. PPL 26(04), 1–17 (2016)
Danturi, P., Nesterenko, M., Tixeuil, S.: Self-stabilizing philosophers with generic conflicts. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 214–230. Springer, Heidelberg (2006). https://doi.org/10.1007/978-3-540-49823-0_15
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)
Dolev, S.: Self-Stabilization. MIT Press (2000)
Ghosh, B., Muthukrishnan, S.: Dynamic load balancing by random matchings. J. Comput. Syst. Sci. 53(3), 357–370 (1996)
Gouda, M.G., Haddix, F.F.: The alternator. Distrib. Comput. 20(1), 21–28 (2007)
Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput. 70(4), 406–415 (2010)
Hedetniemi, S.T., Pokrass Jacobs, D., Srimani, P.K.: Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5), 221–223 (2001)
Higham, L., Johnen, C.: Relationships between communication models in networks using atomic registers. In: IPDPS, Proceedings, pp. 25–29 (2006)
Hsu, S.-C., Huang, S.-T.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett. 43(2), 77–81 (1992)
Huang, S.-T.: The fuzzy philosophers. In: Rolim, J. (ed.) IPDPS 2000. LNCS, vol. 1800, pp. 130–136. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45591-4_16
Johnen, C., Lavallee, I., Lavault, C.: Reliable self-stabilizing communication for quasi rendezvous. arXiv preprint arXiv:1005.5630 (2010)
Kulkarni, S.S., Bolen, C., Oleszkiewicz, J., Robinson, A.: Alternators in read/write atomicity. Inf. Process. Lett. 93(5), 207–215 (2005)
Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A new self-stabilizing maximal matching algorithm. Theor. Comput. Sci. (TCS) 410(14), 1336–1345 (2009)
Mizuno, M., Nesterenko, M.: A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Inf. Process. Lett. 66(6), 285–290 (1998)
Nesterenko, M., Arora, A.: Dining philosophers that tolerate malicious crashes. In: Proceedings 22nd International Conference on Distributed Computing Systems, pp. 191–198 (2002)
Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. J. Parallel Distrib. Comput. 62(5), 766–791 (2002)
Turau, V., Hauck, B.: A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2. Theor. Comput. Sci. (TCS) 412(40), 5527–5540 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Cohen, J., Manoussakis, G., Pilard, L., Sohier, D. (2018). A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)