Carole Delporte-Gallet

Carole Delporte-Gallet

Auto-generated profile, based on publicly available information

Carole Delporte-Gallet

IRIF, Univeristé Paris Cité

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 January 2021
Verified
Book Chapter
Closed access
PDF file
CDCarole Delporte-Gallet
Carole Delporte-Gallet
HFHugues Fauconnier
Hugues Fauconnier
MSMouna Safir
Mouna Safir

9 November 2022
Verified
Book Chapter
Closed access
PDF file
CDCarole Delporte-Gallet
Carole Delporte-Gallet
HFHugues Fauconnier
Hugues Fauconnier
MRMichel Raynal
Michel Raynal
MSMouna Safir
Mouna Safir

10 August 2009
Verified
Conference Paper
Open access
MAMarcos K. Aguilera
Marcos K. Aguilera
CDCarole Delporte-Gallet
Carole Delporte-Gallet
HFHugues Fauconnier
Hugues Fauconnier
STSam Toueg
Sam Toueg
We introduce a new model of partial synchrony for read-write shared memory systems. This model is based on the notion of set timeliness—a natural and straightforward generalization of the seminal concept of timeliness in the partially synchrony model of Dwork, Lynch and Stockmeyer (11). Despite its simplicity, the concept of set timeliness is pow erful enough to define a family of partially synchronous systems that closely match individual instances of the t-resilient k-set agreement prob- lem among n processes, henceforth denoted (t, k, n)-agreement. In particular, we use it to give a par- tially synchronous system that is is synchronous enough for solving (t, k, n)-agreement, but not enough for solving two incrementally stronger problems, namely, (t + 1, k, n)-agreement, which has a slightly stronger resiliency requirement, and (t, k − 1, n)-agreement, which has a slightly stronger agreement requirement. This is the first partially synchronous system that separates between these sub-consensus problems. The above results show that set timeliness can be used to study and compare the partial synchrony requirements of problems that are strictly weaker than consensus.

13 November 2002
Verified
Conference Paper
Closed access
CDC. Delporte-Gallet
C. Delporte-Gallet
HFH. Fauconnier
H. Fauconnier
We describe a group communication system for real-time systems and show how to use it. This system, we call the synchronized phase system (SPS) ensures a property weaker than the classical virtual synchrony, but SPS, with some liveness properties is powerful enough to build an atomic broadcast service. Moreover, for real-time systems we can give explicit bounds on the size of good periods (periods without timing failure) to ensure the timeliness properties on message delivery. This system has been implemented to build a real time atomic broadcast service in the French project ATR.

17 June 2024
Verified
Conference Paper
Open access
CDCarole Delporte-Gallet
Carole Delporte-Gallet
HFHugues Fauconnier
Hugues Fauconnier
PFPierre Fraigniaud
Pierre Fraigniaud
Sergio RajsbaumSergio Rajsbaum
Sergio Rajsbaum
CTCorentin Travers
Corentin Travers
The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (JACM 1999) provided a topological characterization of the tasks that are wait-free solvable by processes communicating through writing and reading shared registers. This characterization assumes the use of full-information protocols, in which each time a process writes in the shared memory, it communicates everything it learned since the beginning of the execution. Thus, each register in the shared memory is of unbounded size. Whether unbounded size registers are unavoidable for the model of computation to be universal is the central question studied in this paper. More generally, when at most t out of n processes can crash, is the model with bounded size registers universal? We show that when 1 ≤ t < n/2 registers of size O(t) bits are sufficient to solve any task that is solvable by a full-information protocol. The situation is radically different when n/2 < t < n, which includes the wait-free case. We show that bounded registers are not universal. Specifically, we show that, for any bound f: ℕ → ℕ, and for any n > 2, there exists a task that cannot be solved by n processes communicating via registers of size f(n) bits, but is solvable by n processes using unbounded registers. The case n = 2, t = 1, where 1-resilient computing and wait-free computing coincide, does not display the same behavior. We show that any task solvable by 2 processes in the wait-free shared-memory model with unbounded-size registers can be solved by 2 processes in the wait-free shared-memory model with constant size registers. Finally, we consider the iterated shared memory model, which has played a crucial role since Herlihy and Shavit's characterization. We show that 1-bit registers (per iteration) are sufficient for solving wait-free any task that is solvable by a full-information wait-free protocol. Therefore, while the wait-free read/write shared-memory model is known to be computationally equivalent to the iterated model, this equivalence only holds if registers are unbounded.

17 July 2005
Verified
Conference Paper
Open access
PDF file
CDCarole Delporte-Gallet
Carole Delporte-Gallet
HFHugues Fauconnier
Hugues Fauconnier
SHStephanie Lorraine Horn
Stephanie Lorraine Horn
STSam Toueg
Sam Toueg