000			02477nam a2200229Ia 4500
003			NULRC
005			20250520102819.0
008			250520s9999 xx 000 0 und d
020			_a9780262026772
040			_cNULRC
050			_aQA 76.58 .F65 2013
100			_aFokkink, Wan _eauthor
245		0	_aDistributed algorithms : _ban intuitive approach / _cWan Fokkink
260			_aCambridge, Massachusetts : _bThe MIT Press, _cc2013
300			_ax, 231 pages : _billustrations ; _c23 cm.
365			_bUSD37.07
504			_aIncludes bibliographical references and index.
505			_aI Message Passing; 2 Preliminaries; 3 Snapshots; 4 Waves; 5 Deadlock Detection; 6 Termination Detection; 7 Garbage Collection; 8 Routing; 9 Election; 10 Anonymous Networks; 11 Synchronous Networks; 12 Crash Failures; 13 Byzantine Failures; 14 Mutual Exclusion; II Shared Memory; 15 Preliminaries; 16 Mutual Exclusion II; 17 Barriers; 18 Self-Stabilization; 19 Online Scheduling; Pseudocode Descriptions; References; Index.
520			_a"This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. An appendix offers pseudocode descriptions of many algorithms. Distributed algorithms are performed by a collection of computers that send messages to each other or by multiple software threads that use the same shared memory. The algorithms presented in the book are for the most part "classics, " selected because they shed light on the algorithmic design of distributed systems or on key issues in distributed computing and concurrent programming. Distributed Algorithms be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field."
650			_aDISTRIBUTED ALGORITHMS -- TEXTBOOKS
942			_2lcc _cBK
999			_c15985 _d15985