14 citations · 15 across the 9 of their papers we have counts for
11 papers
Introducing the Self-Stabilizing SLEEPING Model
Tistou Fages, Colette Johnen, Mikaël Rabie
The SLEEPING LOCAL model introduces a new complexity parameter, the awake complexity, to make distributed algorithms energy-efficient. In the synchronous LOCAL model, nodes can now…
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers
Colette Johnen, Adnane Khattabi, Alessia Milani +1
Relaxing the sequential specification of a shared object is a way to obtain an implementation with better performance compared to implementing the original specification. We apply…
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison
Stéphane Devismes, David Ilcinkas, Colette Johnen +1
We present a self-stabilizing algorithm for the (asynchronous) unison problem which achieves an efficient trade-off between time, workload, and space in a weak model. Precisely, ou…
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments
Stéphane Devismes, David Ilcinkas, Colette Johnen +1
This paper deals with the trade-off between time, workload, and versatility in self-stabilization, a general and lightweight fault-tolerant concept in distributed computing.In this…
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree
Ajoy K. Datta, Stéphane Devismes, Colette Johnen +1
We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019). In this work, we shed new light on a self-stabilizing wave algorit…
Self-Stabilizing Distributed Cooperative Reset
Stéphane Devismes, Colette Johnen
Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient f…