Linear Space Bootstrap Communication Schemes

Delporte-Gallet, Carole; Fauconnier, Hugues; Gafni, Eli; Rajsbaum, Sergio

doi:10.1007/978-3-642-35668-1_25

Cited by 7 publications

(10 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section presents an algorithm building SCD-broadcast on top of SWMR snapshot objects. (Such snapshot objects can be easily obtained from MWMR snapshot objects [16].) Hence, it follows from (a) this algorithm, (b) Algorithm 1, and (c) the impossibility proof to build an atomic register on top of asynchronous message-passing systems where t ≥ n/2 process may crash [5], that SCD-broadcast cannot be implemented in CAMP n,t [t ≥ n/2], and snapshot objects and SCD-broadcast are computationally equivalent.…”

Section: The Computability Limit Of Scd-broadcastmentioning

confidence: 99%

Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects

Imbs

Mostéfaoui

Perrin

et al. 2021

Theoretical Computer Science

View full text Add to dashboard Cite

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 types), and distributed tasks. On the "computability limits" side it shows that SCDbroadcast and read/write registers are computationally equivalent.

show abstract

Section: The Computability Limit Of Scd-broadcastmentioning

confidence: 99%

Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects

Imbs

Mostéfaoui

Perrin

et al. 2021

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Thus, p i knows that it is the i-th process and it can write exclusively to R i while the size of the namespace, N , is assumed to be much bigger than the number of the process, n. In this situation, preallocating a register for each identifier would lead to a distributed algorithm with a very large space complexity, namely N registers. Instead, it is shown in [13] that n multi-writer/multi-reader (MWMR) registers are sufficient to solve any readwrite wait-free solvable task.…”

Section: Introductionmentioning

confidence: 99%

A Characterization of t-Resilient Colorless Task Anonymous Solvability

Delporte-Gallet

Fauconnier

Rajsbaum³

et al. 2018

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

One of the central questions in distributed computability is characterizing the tasks that are solvable in a given system model. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a recent topological characterization (Yanagisawa 2017) of the colorless tasks that are solvable when any number of asynchronous processes may crash. In this paper, we consider the case where at most t asynchronous processes may crash, where 1 ≤ t < n. We prove that a colorless task is t-resilient solvable anonymously if and only if it is t-resilient solvable non-anonymously. We obtain our results through various reductions and simulations that explore how to extend techniques for non-anonymous computation to anonymous one.

show abstract

“…However, often processes, while they know their ids, the number of possible ids N is much bigger than the number of processes, n. In this situation, preallocating a register for each identifier would lead to a distributed algorithm with a very large space complexity, namely N registers. Instead, it is shown in [11] that n multi-writer/multi-reader (MWMR) registers are sufficient to solve any read-write wait-free solvable task.…”

Section: Introductionmentioning

confidence: 99%

A characterization of colorless anonymous $t$-resilient task computability

Delporte-Gallet¹,

Fauconnier²,

Rajsbaum³

et al. 2017

Preprint

Self Cite

View full text Add to dashboard Cite

A task is a distributed problem for n processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous sharedmemory model where each process has a distinct identifier that can be used to access a single-writer/multi-reader shared register. In the anonymous case, where processes have no identifiers and communicate through multiwriter/multi-reader registers, there is a recent topological characterization of the colorless tasks that are solvable when any number of asynchronous processes may crash.In this paper we study the case where at most t processes may crash, where 1 ≤ t < n. We prove that a colorless task is t-resilient solvable non-anonymously if and only if it is t-resilient solvable anonymously. This implies a complete characterization of colorless anonymous t-resilient asynchronous task computability.

show abstract

Linear Space Bootstrap Communication Schemes

Cited by 7 publications

References 25 publications

Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects

Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects

A Characterization of t-Resilient Colorless Task Anonymous Solvability

A characterization of colorless anonymous $t$-resilient task computability

Contact Info

Product

Resources

About