000 03866nam a22003735i 4500
001 280146
003 MX-SnUAN
005 20160429154011.0
007 cr nn 008mamaa
008 150903s2008 xxu| o |||| 0|eng d
020 _a9780387690452
_99780387690452
024 7 _a10.1007/9780387690452
_2doi
035 _avtls000331980
039 9 _a201509030204
_bVLOAD
_c201404122002
_dVLOAD
_c201404091729
_dVLOAD
_y201402041017
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aTK5105.5-5105.9
100 1 _aGeorgiou, Chryssis.
_eautor
_9304890
245 1 0 _aDo-All Computing in Distributed Systems :
_bCooperation in the Presence of Adversity /
_cby Chryssis Georgiou, Alexander A. Shvartsman.
264 1 _aBoston, MA :
_bSpringer US,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
500 _aSpringer eBooks
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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aShvartsman, Alexander A.
_eautor
_9304891
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387309187
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-69045-2
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c280146
_d280146