No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems (Extended Version) - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems (Extended Version)

Sylvain Gay
  • Fonction : Auteur
  • PersonId : 1381403
Achour Mostefaoui
Matthieu Perrin

Résumé

This paper explores the relationship between broadcast abstractions and the k-set agreement (k-SA) problem in crash-prone asynchronous distributed systems. It specifically investigates whether any broadcast abstraction is computationally equivalent to k-SA in message-passing systems. A key contribution of the paper is the introduction of two new symmetry properties: compositionality and content-neutrality, inspired by the principle of network neutrality. Such clarity in definition is essential for this paper's scope, as it aims not to characterize the computing power of a specific broadcast abstraction, but rather to demonstrate the nonexistence of a broadcast abstraction with certain characteristics. Hence, delineating the realm of ``meaningful'' broadcast abstractions becomes essential. The paper's main contribution is the proof that no broadcast abstraction, which is both content-neutral and compositional, is computationally equivalent to k-set agreement when 1
Fichier principal
Vignette du fichier
main.pdf (364.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04571653 , version 1 (08-05-2024)

Identifiants

  • HAL Id : hal-04571653 , version 1

Citer

Sylvain Gay, Achour Mostefaoui, Matthieu Perrin. No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems (Extended Version). 2024. ⟨hal-04571653⟩
0 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More