M. Raynal

Publications
Influence

Communication-based prevention of useless checkpoints in distributed computations

J. Hélary, A. Mostéfaoui, R. Netzer, M. Raynal
Computer Science
Distributed Computing
2000

Summary. A useless checkpoint is a local checkpoint that cannot be part of a consistent global checkpoint. This paper addresses the following problem. Given a set of processes that take (basic) local… Expand

The Causal Ordering Abstraction and a Simple Way to Implement it

M. Raynal, A. Schiper, S. Toueg
Computer Science
Inf. Process. Lett.
1 October 1991

A new message ordering relation, known as causal ordering, has been introduced by Birman and Joseph. Expand

A communication-induced checkpointing protocol that ensures rollback-dependency trackability

R. Baldoni, J. Hélary, A. Mostéfaoui, M. Raynal
Computer Science
Proceedings of IEEE 27th International Symposium…
25 June 1997

This paper develops a protocol that forces processes to take some additional local checkpoints (called forced checkpoints) in order that the resulting checkpoint and communication pattern satisfies the Rollback Dependency Trackability (RDT) property. Expand

Consensus in One Communication Step

F. Brasileiro, F. Greve, A. Mostéfaoui, M. Raynal
Computer Science
PaCT
3 September 2001

This paper presents a novel and surprisingly simple consensus protocol that allows processes to decide in a single communication step when “enough" processes propose the same value. Expand

A Contention-Friendly Binary Search Tree

Tyler Crain, Vincent Gramoli, M. Raynal
Computer Science
Euro-Par
26 August 2013

We propose a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. Expand

Algorithms for mutual exclusion

M. Raynal, D. Beeson
Computer Science
1986

The problem of mutual exclusion - or of defining fundamental operations so that it is possible to resolve conflicts resulting from several concurrent processes sharing the resources of a computer system - has emerged over the last 20 years as a prime example of the difficulties associated with parallel or distributed programming. Expand

Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach

A. Mostéfaoui, M. Raynal
Computer Science
DISC
27 September 1999

This paper addresses the Consensus problem in asynchronous distributed systems (made of n processes, at most f of them may crash) equipped with unreliable failure detectors. Expand

Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages

A. Mostéfaoui, Moumen Hamouma, M. Raynal
Computer Science
PODC '14
15 July 2014

This paper presents a new round-based asynchronous consensus algorithm that copes with up to t<n/3 Byzantine processes, where n is the total number of processes. Expand

Asynchronous implementation of failure detectors

A. Mostéfaoui, Eric Mourgaya, M. Raynal
Computer Science
International Conference on Dependable Systems…
22 June 2003

This paper proposes a new look at the implementation of failure detectors and more specifically at Chandra-Toueg’s failure detectors. Expand

Logical Time: Capturing Causality in Distributed Systems

M. Raynal, M. Singhal
Computer Science
Computer
1 February 1996

This paper presents a general framework of a system of logical clocks in distributed systems and discusses three methods for implementing logical time in these systems. Expand

Recommended Authors