000			04197nam a22004215i 4500
999			_c387303 _d387303
001			387303
003			ES-MaUEC
005			20230312121450.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2010 sz | s |||| 0|eng d
020			_a9783031020018
024	7		_a10.1007/978-3-031-02001-8 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aTK5102.5 _b2010 EB
100	1		_aRaynal, M. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687257 _q(Michel)
245	1	0	_aFault-tolerant Agreement in Synchronous Message-passing Systems _cby Michel Raynal
250			_a1st edition 2010
264		1	_aCham _bSpringer International Publishing _c2010
300			_a1 recurso en línea (XXI, 167 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Distributed Computing Theory _x2155-1634
505	0		_aList 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.
520			_aUnderstanding 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.
988			_aSynthesis Collection of Technology_2010
650		7	_2embne _9156434 _aProceso distribuido (Informática)
650		7	_2embne _9668452 _aTolerancia a los fallos (Informática)
650		7	_2embne _9145058 _aSistemas de transmisión de datos
776	0	8	_iPrinted edition: _z9783031008733
776	0	8	_iPrinted edition: _z9783031031298
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02001-8 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI