2 citations · 5 across the 5 of their papers we have counts for
7 papers · 1 filter
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms
Damien Imbs, Michel Raynal, Gadi Taubenfeld
This article addresses election in fully anonymous systems made up of asynchronous processes that communicate through atomic read-write registers or atomic read-modify-write re…
Mutex-based Desanonymization of an Anonymous Read/Write Memory
Emmanuel Godard, Damien Imbs, Michel Raynal +1
Anonymous shared memory is a memory in which processes use different names for the same shared read/write register. As an example, a shared register named by a process and…
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Zahra Aghazadeh, Damien Imbs, Michel Raynal +2
The notion of an anonymous shared memory (recently introduced in PODC 2017) considers that processes use different names for the same memory location. Hence, there is permanent dis…
Progress-Space Tradeoffs in Single-Writer Memory Implementations
Damien Imbs, Petr Kuznetsov, Thibault Rieutord
Most algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register readable b…
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits
Damien Imbs, Achour Mostefaoui, Matthieu Perrin +1
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…
Which Broadcast Abstraction Captures -Set Agreement?
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin +1
It is well-known that consensus (one-set agreement) and total order broadcast are equivalent in asynchronous systems prone to process crash failures. Considering wait-free systems,…