Matthieu Roy

Learn More
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC’01) consists in identifying sets of input vectors for which it is possible to design a protocol solving the consensus problem for n processes despite the occurrence of up to f process crashes. For each value of f these conditions actually define a(More)
The condition-based approach for consensus solvability consists of identifying sets of input vectors, called conditions, for which there exists an asynchronous protocol solving consensus despite the occurrence of up to f process crashes. This paper investigates $\mathcal{C}_f$ , the largest set of conditions which allow us to solve the consensus problem in(More)
In this paper, we present condition based solutions to k-set agreement problems. A condition C is a set of input vectors to the problem. We identify a class of conditions that allow to solve k-set agreement in spite of f crashes in an asynchronous system. Moreover, we design a protocol that is always safe: it is guaranteed to terminate when the input vector(More)
The explosion in the instrumentation of our environment is driving the need for developing sensor networks that not only observe and measure but that also show a high-level of fault tolerance. Towards this goal, we identify faults and key challenges related to the development and deployment of self-managing dependable sensor networks, on the account of two(More)
In this work we present an abstraction that allows a set of distributed processes, aware of their respective positions in space, to collectively maintain information associated with an area in the physical world. This abstraction is a logical object shared between participating processes that provides two operations, namely read and write.
Although multi/many-core platforms enable the parallel execution of tasks, the sharing of resources may lead to long WCETs that fail to meet the real-time constraints of the system. Then, a safe solution is the execution of the most critical tasks in isolation followed by the execution of the remaining tasks. To improve the system performance, we propose an(More)
When integrating mixed critical systems on a multi/many-core, one challenge is to ensure predictability for high criticality tasks and an increased utilization for low criticality tasks. In this paper, we address this problem when several high criticality tasks with different deadlines, periods and offsets are concurrently executed on the system. We propose(More)