Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. Pour en savoir plus
Skip to Main content Skip to Navigation
Reports

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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01540010
Contributor : Matthieu Perrin Connect in order to contact the contributor
Submitted on : Thursday, June 15, 2017 - 4:02:01 PM
Last modification on : Wednesday, April 27, 2022 - 3:50:52 AM
Long-term archiving on: : Wednesday, December 13, 2017 - 12:45:58 PM

Files

SCD-broadcast-V11.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

614

Files downloads

230