000			01559cam a22002897i 4500
999			_c382676 _d382676
001			19710448
003			APU
005			20190817072358.0
008			190803s2017 enka b 001 0 eng d
010			_a 2017394571
020			_a1785482262 (pbk.)
020			_a9781785482267 (pbk.)
035			_a(OCoLC)ocn971354735
040			_aYDX _beng _cYDX _dWAN
042			_alccopycat
050	0	0	_aQA76.9.D5 _bP47 2017
082	0	4	_a004/.36 _223
100	1		_aPerrin, Matthieu. _943977
245	1	0	_aDistributed systems : _bconcurrency and consistency / _cMatthieu Perrin.
260			_aKidington, Oxford, UK : _bElsevier, _c2017.
300			_axxvii, 159 pages : _billustrations ; _c24 cm.
504			_aIncludes bibliographical references and index.
520			_aDistributed Systems: Concurrency and Consistency explores the gray area of distributed systems and draws a map of weak consistency criteria, identifying several families and demonstrating how these may be implemented into a programming language. Unlike their sequential counterparts, distributed systems are much more difficult to design, and are therefore prone to problems. On a large scale, usability reminiscent of sequential consistency, which would provide the same global view to all users, is very expensive or impossible to achieve. This book investigates the best ways to specify the objects that are still possible to implement in these systems.
650		0	_aElectronic data processing _xDistributed processing. _943978
650		0	_aSystem design. _944141
942			_2lcc _cBook