A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model

Résumé

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 A_1 under the unfair distributed daemon dealing with some relaxed constraints on the communication model. Second, we adapt A_1 so that it can handle the fair distributed daemon, leading to the A_2 algorithm. We prove that algorithm A_1 stabilizes in O(m\Delta) moves and algorithm A_2 in O(m\Delta) rounds, with \Delta the maximum degree and m the number of edges.

Domaines

Informatique
Fichier non déposé

Dates et versions

hal-01974891 , version 1 (09-01-2019)

Identifiants

  • HAL Id : hal-01974891 , version 1

Citer

Johanne Cohen, George Manoussakis, Laurence Pilard, Devan Sohier. A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model. SIROCCO 2018: International Colloquium on Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. pp.14-19. ⟨hal-01974891⟩
94 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More