000			02940nam a22004095i 4500
999			_c387307 _d387307
001			387307
003			ES-MaUEC
005			20230312125310.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2012 sz | s |||| 0|eng d
020			_a9783031020070
024	7		_a10.1007/978-3-031-02007-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.D5 _b2012 EB
100	1		_aVukolić, Marko _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687265
245	1	0	_aQuorum Systems : _bWith Applications to Storage and Consensus _cby Marko Vukolic
250			_a1st edition 2012
264		1	_aCham _bSpringer International Publishing _c2012
300			_a1 recurso en línea (XV, 130 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		_aIntroduction -- Preliminaries -- Classical Quorum Systems -- Classical Quorum-Based Emulations -- Byzantine Quorum Systems -- Latency-efficient Quorum Systems -- Probabilistic Quorum Systems.
520			_aA quorum system is a collection of subsets of nodes, called quorums, with the property that each pair of quorums have a non-empty intersection. Quorum systems are the key mathematical abstraction for ensuring consistency in fault-tolerant and highly available distributed computing. Critical for many applications since the early days of distributed computing, quorum systems have evolved from simple majorities of a set of processes to complex hierarchical collections of sets, tailored for general adversarial structures. The initial non-empty intersection property has been refined many times to account for, e.g., stronger (Byzantine) adversarial model, latency considerations or better availability. This monograph is an overview of the evolution and refinement of quorum systems, with emphasis on their role in two fundamental applications: distributed read/write storage and consensus. Table of Contents: Introduction / Preliminaries / Classical Quorum Systems / Classical Quorum-Based Emulations / Byzantine Quorum Systems / Latency-efficient Quorum Systems / Probabilistic Quorum Systems.
988			_aSynthesis Collection of Technology_2012
650		7	_2embne _9156434 _aProceso distribuido (Informática) _xModelos matemáticos
650		7	_2embne _9151819 _aAlgoritmos computacionales
776	0	8	_iPrinted edition: _z9783031008795
776	0	8	_iPrinted edition: _z9783031031359
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02007-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI