Amazon cover image
Image from Amazon.com

Distributed computing through combinatorial topology / Maurice Herlihy, Dmitry Kozlov and Sergio Rajsbaum

By: Contributor(s): Material type: TextTextPublication details: Waltham, MA. : Elsevier Inc., c2014Description: xiv, 319 pages : illustrations ; 24 cmISBN:
  • 9780124045781
Subject(s): LOC classification:
  • QA 76.9 .H47 2014
Contents:
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.
Summary: 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.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Graduate Studies General Circulation Gen. Ed. - CCIT GC QA 76.9 .H47 2014 (Browse shelf(Opens below)) c.1 Available NULIB000014062

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.

to post a comment.