000			04018nam a2200421 i 4500
999			_c386964 _d386964
001			386964
003			ES-MaUEC
005			20230201154406.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2011 sz | o |||| 0|eng d
020			_a9783031020056
024	7		_a10.1007/978-3-031-02005-6 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.D5 _b2011 EB
100	1		_aGeorgiou, Chryssis _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686418
245	1	0	_aCooperative Task-Oriented Computing : _bAlgorithms and Complexity _cby Chryssis Georgiou, Alexander Shvartsman
250			_a1st edition 2011
264		1	_aCham _bSpringer International Publishing _c2011
300			_a1 recurso en línea (X, 155 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 -- Distributed Cooperation and Adversity -- Paradigms and Techniques -- Shared-Memory Algorithms -- Message-Passing Algorithms -- The Do-All Problem in Other Settings -- Bibliography -- Authors' Biographies.
520			_aCooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposition of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Settings / Bibliography / Authors' Biographies.
988			_aSynthesis Collection of Technology_2011
650		7	_2embne _9156434 _aProceso distribuido (Informática)
650		7	_2embne _9141354 _aRedes informáticas
700	1		_aShvartsman, Alex Allister _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686419
776	0	8	_iPrinted edition: _z9783031008771
776	0	8	_iPrinted edition: _z9783031031335
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02005-6 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_dz _eb _zSI _b02/2023