You are here

Publication of Michel Raynal's book "Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach."

Michel Raynal, author among the world's leading researchers in distributed computing, has just published a new book "Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach".

Professor Michel Raynal is among the top researchers in the world on the topic of distributed algorithms. Michel Raynal, professor emeritus at the University of Rennes 1 and member of the research team WIDE (IRISA, Inria) created in 1985 one of the very first research teams in Europe and one of the first teams in the world, dedicated to distributed algorithms.
He has been the principal investigator in numerous related research national and international projects, and he has been invited by many universities around the world to give lectures on distributed algorithms and distributed computing. Michel Raynal has over 400 academic publications on this topic, he has authored twelve books on related topics.
He has received numerous national and international recognitions, including those of Senior Member of the Institut Universitaire de France, Member of Academia Europaea, member of the Board of Directors and the Scientific Council of SIF and he also holds the Distributed Algorithms Chair at Polytechnic University (PolyU) in Hong Kong.

Visit Michel Raynal's page



LivreMichelRaynal.jpgThis book presents the most important fault-tolerant distributed programming abstractions and their associated distributed algorithms, in particular in terms of reliable communication and agreement, which lie at the heart of nearly all distributed applications. These programming abstractions, distributed objects or services, allow software designers and programmers to cope with asynchrony and the most important types of failures such as process crashes, message losses, and malicious behaviors of computing entities, widely known under the term "Byzantine fault-tolerance". The author introduces these notions in an incremental manner, starting from a clear specification, followed by algorithms which are first described intuitively and then proved correct. 

The book also presents impossibility results in classic distributed computing models, along with strategies, mainly failure detectors and randomization, that allow us to enrich these models. In this sense, the book constitutes an introduction to the science of distributed computing, with applications in all domains of distributed systems, such as cloud computing and blockchains. Each chapter comes with exercises and bibliographic notes to help the reader approach, understand, and master the fascinating field of fault-tolerant distributed computing.

Visit the editor's page