000			01639nam a2200241Ia 4500
003			NULRC
005			20250520102819.0
008			250520s9999 xx 000 0 und d
020			_a9781627051705
040			_cNULRC
050			_aQA 76.9 .A88 2014
100			_aAttiya, Hagit _eauthor
245		0	_aImpossibility results for distributed computing / _cHagit Attiya and Faith Ellen
260			_a[San Rafael, California] : _bMorgan & Claypool Publishers, _cc2014
300			_axiii, 146 pages : _billustrations ; _c24 cm.
365			_bUSD50.86
504			_aIncludes bibliographical references and index.
505			_a1. Introduction -- 2. Indistinguishability -- 3. Shifting and scaling -- 4. Scenario arguments -- 5. Information theory arguments -- 6. Covering arguments -- 7. Valency arguments -- 8. Combinatorial arguments -- 9. Reductions and simulations.
520			_aTo understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared.
650			_aUNSOLVABILITY (MATHEMATICAL LOGIC)
700			_aEllen, Faith _eco-author
942			_2lcc _cBK
999			_c15994 _d15994