Distributed Computing Through Combinatorial Topology, 1st Edition

  • Published By:
  • ISBN-10: 0124047289
  • ISBN-13: 9780124047280
  • DDC: 004.36
  • Grade Level Range: College Freshman - College Senior
  • 336 Pages | eBook
  • Original Copyright 2013 | Published/Released June 2014
  • This publication's content originally published in print form: 2013

  • Price:  Sign in for price



Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award-winning research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book is a self-contained explanation of the mathematics for readers with computer science backgrounds. It also explains computer science concepts to readers with applied mathematics backgrounds. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts—first, proving a simple result that lends itself to examples and pictures and then generalizing the concept to prove a more sophisticated result. The overall result weaves together basic concepts, presenting them in an intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course.

Table of Contents

Front Cover.
Half Title Page.
Title Page.
Copyright Page.
Dedication Page.
1: Fundamentals.
2: Introduction.
3: Two-Process Systems.
4: Elements of Combinatorial Topology.
5: Colorless Tasks.
6: Colorless Wait-Free Computation.
7: Solvability of Colorless Tasks in Different Models.
8: Byzantine-Resilient Colorless Computation.
9: Simulations and Reductions.
10: General Tasks.
11: Read-Write Protocols for General Tasks.
12: Manifold Protocols.
13: Connectivity.
14: Wait-Free Computability for General Tasks.
15: Advanced Topics.
16: Renaming and Oriented Manifolds.
17: Task Solvability in Different Models.
18: Simulations and Reductions for Colored Tasks.
19: Classifying Loop Agreement Tasks.
20: Immediate Snapshot Subdivisions.