Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits

Abstract : This paper introduces a new communication abstraction, called Set-Constrained Delivery Broadcast (SCD-broadcast), whose aim is to provide its users with an appropriate abstraction level when they have to implement objects or distributed tasks in an asynchronous message-passing system prone to process crash failures. This abstraction allows each process to broadcast messages and deliver a sequence of sets of messages in such a way that, if a process delivers a set of messages including a message m and later delivers a set of messages including a message m ′ , no process delivers first a set of messages including m ′ and later a set of message including m. After having presented an algorithm implementing SCD-broadcast, the paper investigates its programming power and its computability limits. On the " power " side it presents SCD-broadcast-based algorithms, which are both simple and efficient, building objects (such as snapshot and conflict-free replicated data), and distributed tasks. On the " computability limits " side it shows that SCD-broadcast and read/write registers are computationally equivalent.
Type de document :
Rapport
[Research Report] LIF, Université Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Université de Rennes. 2017
Liste complète des métadonnées

Littérature citée [33 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01540010
Contributeur : Matthieu Perrin <>
Soumis le : jeudi 15 juin 2017 - 16:02:01
Dernière modification le : mardi 5 septembre 2017 - 10:42:14

Fichiers

SCD-broadcast-V11.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01540010, version 1
  • ARXIV : 1706.05267

Citation

Damien Imbs, Achour Mostefaoui, Matthieu Perrin, Michel Raynal. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. [Research Report] LIF, Université Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Université de Rennes. 2017. 〈hal-01540010〉

Partager

Métriques

Consultations de
la notice

357

Téléchargements du document

47