000			05378nam a22003618i 4500
001			CR9781139168724
003			UkCbUP
005			20221102214124.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			141103s2000||||enk o ||1 0|eng|d
020			_a9781139168724 (ebook)
020			_z9780521794831 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.9.D5 _bT44 2000
082	0	0	_a005.2/76 _221
100	1		_aTel, Gerard, _eauthor. _966963
245	1	0	_aIntroduction to distributed algorithms / _cGerard Tel.
250			_aSecond edition.
264		1	_aCambridge : _bCambridge University Press, _c2000.
300			_a1 online resource (xii, 596 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0	0	_g1 _tIntroduction: Distributed Systems _g1 -- _g1.2 _tArchitecture and Languages _g18 -- _g1.3 _tDistributed Algorithms _g26 -- _g1.4 _tOutline of the Book _g36 -- _gPart 1 _tProtocols _g41 -- _g2 _tModel _g43 -- _g2.1 _tTransition Systems and Algorithms _g44 -- _g2.2 _tProving Properties of Transition Systems _g50 -- _g2.3 _tCausal Order of Events and Logical Clocks _g54 -- _g2.4 _tAdditional Assumptions, Complexity _g64 -- _g3 _tCommunication Protocols _g74 -- _g3.1 _tBalanced Sliding-window Protocol _g76 -- _g3.2 _tA Timer-based Protocol _g85 -- _g4 _tRouting Algorithms _g103 -- _g4.1 _tDestination-based Routing _g105 -- _g4.2 _tAll-pairs Shortest-path Problem _g110 -- _g4.3 _tNetchange Algorithm _g123 -- _g4.4 _tRouting with Compact Routing Tables _g132 -- _g4.5 _tHierarchical Routing _g149 -- _g5 _tDeadlock-free Packet Switching _g155 -- _g5.2 _tStructured Solutions _g158 -- _g5.3 _tUnstructured Solutions _g167 -- _gPart 2 _tFundamental Algorithms _g179 -- _g6 _tWave and Traversal Algorithms _g181 -- _g6.1 _tDefinition and Use of Wave Algorithms _g182 -- _g6.2 _tA Collection of Wave Algorithms _g190 -- _g6.3 _tTraversal Algorithms _g202 -- _g6.4 _tTime Complexity: Depth-first Search _g208 -- _g7 _tElection Algorithms _g227 -- _g7.2 _tRing Networks _g232 -- _g7.3 _tArbitrary Networks _g245 -- _g7.4 _tKorach-Kutten-Moran Algorithm _g260 -- _g8 _tTermination Detection _g268 -- _g8.2 _tComputation Trees and Forests _g276 -- _g8.3 _tWave-based Solutions _g284 -- _g9 _tAnonymous Networks _g307 -- _g9.2 _tDeterministic Algorithms _g317 -- _g9.3 _tA Probabilistic Election Algorithm _g323 -- _g9.4 _tComputing the Network Size _g327 -- _g10 _tSnapshots _g335 -- _g10.2 _tTwo Snapshot Algorithms _g340 -- _g10.3 _tUsing Snapshot Algorithms _g344 -- _g10.4 _tApplication: Deadlock Detection _g349 -- _g11 _tSense of Direction and Orientation _g356 -- _g11.2 _tElection in Rings and Chordal Rings _g364 -- _g11.3 _tComputing in Hypercubes _g374 -- _g11.4 _tComplexity-related Issues _g386 -- _g12 _tSynchrony in Networks _g396 -- _g12.2 _tElection in Synchronous Networks _g404 -- _g12.3 _tSynchronizer Algorithms _g408 -- _g12.4 _tApplication: Breadth-first Search _g414 -- _g12.5 _tArchimedean Assumption _g420 -- _gPart 3 _tFault Tolerance _g425 -- _g13 _tFault Tolerance in Distributed Systems _g427 -- _g13.1 _tReasons for Using Fault-tolerant Algorithms _g427 -- _g13.2 _tRobust Algorithms _g429 -- _g13.3 _tStabilizing Algorithms _g435 -- _g14 _tFault Tolerance in Asynchronous Systems _g437 -- _g14.1 _tImpossibility of Consensus _g437 -- _g14.2 _tInitially Dead Processes _g442 -- _g14.3 _tDeterministically Achievable Cases _g445 -- _g14.4 _tProbabilistic Consensus Algorithms _g451 -- _g14.5 _tWeak Termination _g462 -- _g15 _tFault Tolerance in Synchronous Systems _g469 -- _g15.1 _tSynchronous Decision Protocols _g470 -- _g15.2 _tAuthenticating Protocols _g481 -- _g15.3 _tClock Synchronization _g493 -- _g16 _tFailure Detection _g505 -- _g16.2 _tSolving Consensus with a Weakly Accurate Detector _g510 -- _g16.3 _tEventually Weakly Accurate Detectors _g511 -- _g16.4 _tImplementation of Failure Detectors _g515 -- _g17 _tStabilization _g520 -- _g17.2 _tGraph Algorithms _g526 -- _g17.3 _tMethodology for Stabilization _g535 -- _tA Pseudocode Conventions _g551 -- _gB _tGraphs and Networks _g556.
520			_aDistributed algorithms have been the subject of intense development over the last twenty years. The second edition of this successful textbook provides an up-to-date introduction both to the topic, and to the theory behind the algorithms. The clear presentation makes the book suitable for advanced undergraduate or graduate courses, whilst the coverage is sufficiently deep to make it useful for practising engineers and researchers. The author concentrates on algorithms for the point-to-point message passing model, and includes algorithms for the implementation of computer communication networks. Other key areas discussed are algorithms for the control of distributed applications (wave, broadcast, election, termination detection, randomized algorithms for anonymous networks, snapshots, deadlock detection, synchronous systems), and fault-tolerance achievable by distributed algorithms. The two new chapters on sense of direction and failure detectors are state-of-the-art and will provide an entry to research in these still-developing topics.
650		0	_aElectronic data processing _xDistributed processing _vCongresses. _94596
650		0	_aComputer algorithms _vCongresses. _94597
776	0	8	_iPrint version: _z9780521794831
856	4	0	_uhttps://doi.org/10.1017/CBO9781139168724
942			_cETB
999			_c81821 _d81821