TY  - BOOK
AU  - Herlihy, Maurice
AU  - Kozlov, Dmitry;Rajsbaum, Sergio
TI  - Distributed computing through combinatorial topology
SN  - 9780124045781
AV  - QA 76.9 .H47 2014 
PY  - 2014///
CY  - Waltham, MA.
PB  - Elsevier Inc.
KW  - ELECTRONIC DATA PROCESSING -- DISTRIBUTED PROCESSING -- MATHEMATICS
N1  - Includes bibliographical references and index; I. 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
N2  - Describes 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
ER  -