2015 - Member of Academia Europaea
Michel Raynal focuses on Distributed computing, Theoretical computer science, Asynchronous communication, Distributed algorithm and Protocol. Michel Raynal has researched Distributed computing in several fields, including Computer network, Computation and Crash. His studies deal with areas such as Tree structure, Algorithm design, Scheduling and Parallel computing as well as Theoretical computer science.
His biological study spans a wide range of topics, including Context, Chandra–Toueg consensus algorithm, Shared memory and Quantum Byzantine agreement. His Distributed algorithm study combines topics from a wide range of disciplines, such as Algorithm, Randomized algorithm and Correctness. His Protocol study incorporates themes from Reliability, Class, Set, Property and Software fault tolerance.
His scientific interests lie mostly in Distributed computing, Theoretical computer science, Asynchronous communication, Distributed algorithm and Algorithm. Michel Raynal studies Fault tolerance which is a part of Distributed computing. The Theoretical computer science study combines topics in areas such as Object, Context, Computation and Set.
His Asynchronous communication study combines topics in areas such as Process, Message passing, Crash and Shared memory. His Distributed algorithm study combines topics from a wide range of disciplines, such as Byzantine fault tolerance and Quantum Byzantine agreement. His work carried out in the field of Algorithm brings together such families of science as Discrete mathematics, Value, Class, K-set and Upper and lower bounds.
His main research concerns Asynchronous communication, Theoretical computer science, Asynchronous system, Abstraction and Message passing. The concepts of his Asynchronous communication study are interwoven with issues in Fault tolerance and Crash. His Fault tolerance study is concerned with the field of Distributed computing as a whole.
In the subject of general Theoretical computer science, his work in Mutual exclusion is often linked to Simple, thereby combining diverse domains of study. The study incorporates disciplines such as Concurrent computing and Vertex in addition to Message passing. He interconnects Discrete mathematics and Atomic broadcast in the investigation of issues within Distributed algorithm.
Michel Raynal mainly investigates Asynchronous communication, Theoretical computer science, Shared memory, Algorithm and Message passing. His studies deal with areas such as Abstraction, Snapshot, Code, Byzantine fault tolerance and Node as well as Asynchronous communication. His Theoretical computer science research incorporates elements of Object and Locality.
His Shared memory research is multidisciplinary, incorporating perspectives in Context, Process, Mutual exclusion and Anonymity. His study with Message passing involves better knowledge in Distributed computing. His research integrates issues of Wireless, Partition and Network packet in his study of Distributed computing.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Algorithms for mutual exclusion
M. Raynal;D. Beeson.
Logical time: capturing causality in distributed systems
M. Raynal;M. Singhal.
IEEE Computer (1996)
The causal ordering abstraction and a simple way to implement it
Michel Raynal;André Schiper;Sam Toueg.
Information Processing Letters (1991)
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach
Achour Mostéfaoui;Michel Raynal.
international symposium on distributed computing (1999)
Distributed Algorithms and Protocols
Distributed Algorithms for Message-Passing Systems
Concurrent Programming: Algorithms, Principles, and Foundations
Asynchronous implementation of failure detectors
A. Mostefaoui;E. Mourgaya;M. Raynal.
dependable systems and networks (2003)
A simple taxonomy for distributed mutual exclusion algorithms
Operating Systems Review (1991)
An adaptive failure detection protocol
C. Fetzer;M. Raynal;F. Tronel.
pacific rim international symposium on dependable computing (2001)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: