ABSTRACT

Most applications in distributed computing center around a set of common subproblems. Distributed Systems: An Algorithmic Approach presents the algorithmic issues and necessary background theory that are needed to properly understand these challenges.

Achieving a balance between theory and practice, this book bridges the gap betwee

part |2 pages

Part A: Background Materials

chapter 1|10 pages

Introduction

chapter 2|22 pages

Interprocess Communication: An Overview

part |2 pages

Part B: Foundational Topics

chapter 3|18 pages

Models of Communication

chapter 5|20 pages

Program Correctness

chapter 6|14 pages

Time in a Distributed System

part |2 pages

Part C: Important Paradigms

chapter 7|22 pages

Mutual Exclusion

chapter 8|10 pages

Distributed Snapshot

chapter 9|14 pages

Global State Collection

chapter 10|22 pages

Graph Algorithms

chapter 11|16 pages

Coordination Algorithms

part |2 pages

Part D: Faults and Fault-Tolerant Systems

chapter 12|18 pages

Fault-Tolerant Systems

chapter 13|18 pages

Distributed Consensus

chapter 14|16 pages

Distributed Transactions

chapter 15|20 pages

Group Communication

chapter 16|18 pages

Replicated Data Management

chapter 17|20 pages

Self-Stabilizing Systems

part |2 pages

Part E: Real World Issues

chapter 18|10 pages

Distributed Discrete-Event Simulation

chapter 19|26 pages

Security in Distributed Systems

chapter 20|24 pages

Sensor Networks

chapter 21|20 pages

Peer-to-Peer Networks