Verwandte Artikel zu Fault-Tolerant Message-Passing Distributed Systems:...
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>
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2018
- ISBN 10 3319941402
- ISBN 13 9783319941400
- EinbandTapa dura
- SpracheEnglisch
- Auflage1
- Anzahl der Seiten492
Neu kaufen
Diesen Artikel anzeigen
EUR 87,22
EUR 14,16 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer
Suchergebnisse für Fault-Tolerant Message-Passing Distributed Systems:...
Beispielbild für diese ISBN
Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In English. Artikel-Nr. ria9783319941400_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Fault-Tolerant Message-Passing Distributed Systems: An Algorithmic Approach : An Algorithmic Approach
Verlag:
Springer International Publishing, 2018
ISBN 10: 3319941402
ISBN 13: 9783319941400
Gebraucht
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebundene Ausgabe. Zustand: Sehr gut. Gebraucht - Sehr gut SG - leichte Beschädigungen oder Verschmutzungen, ungelesenes Mängelexemplar, gestempelt - 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. Artikel-Nr. INF1000558325
Anzahl: 1 verfügbar
Foto des Verkäufers
Fault-Tolerant Message-Passing Distributed Systems : An Algorithmic Approach
Verlag:
Springer International Publishing, 2018
ISBN 10: 3319941402
ISBN 13: 9783319941400
Neu
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9783319941400
Anzahl: 1 verfügbar