000			01824nam a2200241Ia 4500
003			NULRC
005			20250520102826.0
008			250520s9999 xx 000 0 und d
020			_a9780124045781
040			_cNULRC
050			_aQA 76.9 .H47 2014
100			_aHerlihy, Maurice _eauthor
245		0	_aDistributed computing through combinatorial topology / _cMaurice Herlihy, Dmitry Kozlov and Sergio Rajsbaum
260			_aWaltham, MA. : _bElsevier Inc., _cc2014
300			_axiv, 319 pages : _billustrations ; _c24 cm.
365			_bUSD67.8
504			_aIncludes bibliographical references and index.
505			_aI. Fundamentals -- 1. Introduction -- 2. Two-process systems -- 3. Elements of combinatorial topology -- II. Colorless tasks -- 4. Colorless wait-free computation -- 5. Solvability of colorless tasks -- 6. Byzantine colorless computation -- 7. Simulations and reductions -- III. General tasks -- 8. Read-write protocols for general tasks -- 9. Manifold protocols -- 10. Connectivity -- 11. Wait-free computability for general tasks -- IV. Advanced topics -- 12. Renaming and oriented manifolds -- 13. Task solvability in different communication models -- 14. Colored simulations and reductions -- 15. Classifying loop agreement tasks -- 16. Immediate snapshot subdivisions.
520			_aDescribes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. This book presents a theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols.
650			_aELECTRONIC DATA PROCESSING -- DISTRIBUTED PROCESSING -- MATHEMATICS
700			_aKozlov, Dmitry;Rajsbaum, Sergio _eco-author;co-author
942			_2lcc _cBK
999			_c16303 _d16303