000			04212nam a22005175i 4500
001			978-0-387-69045-2
003			DE-He213
005			20250710084009.0
007			cr nn 008mamaa
008			100301s2008 xxu| s |||| 0|eng d
020			_a9780387690452 _a99780387690452
024	7		_a10.1007/978-0-387-69045-2 _2doi
082	0	4	_a004.6 _223
100	1		_aGeorgiou, Chryssis. _eauthor.
245	1	0	_aDo-All Computing in Distributed Systems _h[recurso electrónico] : _bCooperation in the Presence of Adversity / _cby Chryssis Georgiou, Alexander A. Shvartsman.
264		1	_aBoston, MA : _bSpringer US, _c2008.
300			_bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aDistributed Cooperation Problems: Models and Definitions -- Synchronous Do-All with Crashes: Using Perfect Knowledge and Reliable Multicast -- Synchronous Do-All with Crashes and Point-to-Point Messaging -- Synchronous Do-All with Crashes and Restarts -- Synchronous Do-All with Byzantine Failures -- Asynchrony and Delay-Sensitive Bounds -- Analysis of Omni-Do in Asynchronous Partitionable Networks -- Competitive Analysis of Omni-Do in Partitionable Networks -- Cooperation in the Absence of Communication -- Related Cooperation Problems and Models.
520			_aThe ability to cooperatively perform a collection of tasks in a distributed system is key to solving a broad array of computation problems ranging from distributed search, to distributed simulation, and multi-agent collaboration. Practical solutions to such cooperation problems must effectively marshal the available computing resources in performing large sets of tasks. This is challenging due to the failures and asynchrony of the involved processors, and due to the delays and connectivity failures in the underlying network. Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity is the first book that presents an in depth study of cooperation problems, abstracted in terms of the Do-All problem, where a collection of processors cooperatively perform a collection of independent tasks in the presence of adversity. This book presents several significant advances in algorithms designed to solve the Do-All problem in distributed message-passing settings under various models of adversity, including processor crashes, asynchrony, message delays, network partitions, and malicious processor behaviors. Upper and lower bounds are presented, demonstrating the extent to which efficiency can be combined with fault-tolerance. This book contains the recent advances in the principles of efficient and fault-tolerant cooperative computing, narrowing the gap between abstract models of dependable network computing and realistic distributed systems. Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity is structured to meet the needs of a professional audience composed of researchers and practitioners in industry. This volume is also suitable as a reference or secondary text for advanced-level students in computer science and engineering.
650		0	_aCOMPUTER SCIENCE.
650		0	_aDATA TRANSMISSION SYSTEMS.
650		0	_aCOMPUTER NETWORK ARCHITECTURES.
650		0	_aCOMPUTER COMMUNICATION NETWORKS.
650		0	_aOPERATING SYSTEMS (COMPUTERS).
650		0	_aINFORMATION THEORY.
650		0	_aCOMPUTER SOFTWARE.
650	1	4	_aCOMPUTER SCIENCE.
650	2	4	_aCOMPUTER COMMUNICATION NETWORKS.
650	2	4	_aOPERATING SYSTEMS.
650	2	4	_aTHEORY OF COMPUTATION.
650	2	4	_aALGORITHM ANALYSIS AND PROBLEM COMPLEXITY.
650	2	4	_aCOMPUTER SYSTEMS ORGANIZATION AND COMMUNICATION NETWORKS.
650	2	4	_aINPUT/OUTPUT AND DATA COMMUNICATIONS.
700	1		_aShvartsman, Alexander A. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387309187
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-69045-2 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SCS
942			_2ddc _cER
999			_c58081 _d58081