Distributed computing through combinatorial topology / Maurice Herlihy, Dmitry Kozlov and Sergio Rajsbaum
Material type:
TextPublication details: Waltham, MA. : Elsevier Inc., c2014Description: xiv, 319 pages : illustrations ; 24 cmISBN: 9780124045781Subject(s): ELECTRONIC DATA PROCESSING -- DISTRIBUTED PROCESSING -- MATHEMATICS | COMBINATORIAL TOPOLOGYLOC classification: QA 76.9 .H47 2014
Books
| Item type | Current library | Home library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
LRC - Graduate Studies | National University - Manila | Gen. Ed. - CCIT | General Circulation | GC QA 76.9 .H47 2014 (Browse shelf (Opens below)) | c.1 | Available | NULIB000014062 |
Browsing National University - Manila shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| GC QA 76.9 .G85 2015 Big data analytics with Spark : a practitioner's guide to using Spark for large scale data analysis / | GC QA 76.9 .H34 2008 Discrete mathematics for engineers and scientist / | GC QA 76.9 .H35 2016 Handbook of research on human-computer interfaces, developments, and applications / | GC QA 76.9 .H47 2014 Distributed computing through combinatorial topology / | GC QA 76.9 .H64 2009 Applied computer keyboarding : use with MicroType software / | GC QA 76.9 .K46 2014 System analysis and design / | GC QA 76.9 .K57 2013 The Data warehouse toolkit : the definitive guide to dimensional modeling / |
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.
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.
There are no comments on this title.