Fault-tolerant Agreement in Synchronous Message-passing Systems / by Michel Raynal
By: Raynal, M.(Michel), autor
Material type:
E-bookSeries: (Synthesis Lectures on Distributed Computing Theory, 2155-1634).Publisher: Cham : Springer International Publishing, 2010Edition: 1st edition 2010.Description: 1 recurso en línea (XXI, 167 páginas).ISBN: 9783031020018.Subject: Proceso distribuido (Informática)
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
LIBRO-E NO PRÉSTAMO
|
Madrid Digital Acceso Electrónico (UEM) | Ciencias e Ingeniería | TK5102.5 2010 EB (Browse shelf(Opens below)) | Acceso electrónico | eBook.01112502 |
Browsing Madrid Digital shelves, Shelving location: Acceso Electrónico (UEM) Close shelf browser (Hides shelf browser)
| TK5101-5105.9 2022 EB Doctoral Symposium on Information and Communication Technologies - DSICT | TK5101-5105.9 2022 EB Smart Antennas : Latest Trends in Design and Application | TK5102.5 2007 EB PSpice for Analog Communications Engineering | TK5102.5 2010 EB Fault-tolerant Agreement in Synchronous Message-passing Systems | TK5102.5 2015 EB Waveform Analysis of Sound | TK5102.5 2019 EB Recent Trends in Signal and Image Processing : Proceedings of ISSIP 2018 | TK5102.5 2021 EB Blockchain Systems and Communication Networks: From Concepts to Implementation |
List of Figures -- Synchronous Model, Failure Models, and Agreement Problems -- Consensus and Interactive Consistency in the Crash Failure Model -- Expedite Decision in the Crash Failure Model -- Simultaneous Consensus Despite Crash Failures -- From Consensus to k-Set Agreement -- Non-Blocking Atomic Commit in Presence of Crash Failures -- k-Set Agreement Despite Omission Failures -- Consensus Despite Byzantine Failures -- Byzantine Consensus in Enriched Models.
Understanding distributed computing is not an easy task. This is due to the many facets of uncertainty one has to cope with and master in order to produce correct distributed software. A previous book Communication and Agreement Abstraction for Fault-tolerant Asynchronous Distributed Systems (published by Morgan & Claypool, 2010) was devoted to the problems created by crash failures in asynchronous message-passing systems. The present book focuses on the way to cope with the uncertainty created by process failures (crash, omission failures and Byzantine behavior) in synchronous message-passing systems (i.e., systems whose progress is governed by the passage of time). To that end, the book considers fundamental problems that distributed synchronous processes have to solve. These fundamental problems concern agreement among processes (if processes are unable to agree in one way or another in presence of failures, no non-trivial problem can be solved). They are consensus, interactive consistency, k-set agreement and non-blocking atomic commit. Being able to solve these basic problems efficiently with provable guarantees allows applications designers to give a precise meaning to the words ""cooperate"" and ""agree"" despite failures, and write distributed synchronous programs with properties that can be stated and proved. Hence, the aim of the book is to present a comprehensive view of agreement problems, algorithms that solve them and associated computability bounds in synchronous message-passing distributed systems. Table of Contents: List of Figures / Synchronous Model, Failure Models, and Agreement Problems / Consensus and Interactive Consistency in the Crash Failure Model / Expedite Decision in the Crash Failure Model / Simultaneous Consensus Despite Crash Failures / From Consensus to k-Set Agreement / Non-Blocking Atomic Commit in Presence of Crash Failures / k-Set Agreement Despite Omission Failures / Consensus Despite Byzantine Failures / Byzantine Consensus in Enriched Models.
There are no comments on this title.