Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach - Hardcover

Raynal, Michel

Hardcover

ISBN 10: 3319941402 ISBN 13: 9783319941400

Verlag: Springer, 2018

Inhaltsangabe

<P>THIS 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.&NBSP;</P>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.<P></P>

Über diesen Titel

Reseña del editor

This 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.

Biografía del autor

Prof. Michel Raynal is among the top researchers in the world on the topic of distributed algorithms. He is a full professor at IRISA (Université de Rennes, France), where he founded in 1984 one of the very first research groups on 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. He has over 400 academic publications on this topic, he has authored twelve books on related topics, and he was involved in all the key conferences in distributed computing. His current research interests include distributed algorithms, distributed computing systems, distributed computability and dependability, and the fundamental principles that underlie the design and construction of distributed computing systems. Michel Raynal is also Distinguished Chair Professor at the Polytechnic University of Hong Kong.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2018
• ISBN 10: 3319941402
• ISBN 13: 9783319941400
• Einband: Tapa dura
• Sprache: Englisch
• Auflage: 1
• Anzahl der Seiten: 492