Distributed Systems

5.

Coordination and Agreement

5.1.

Distributed Mutual Exclusion

5.1.1.

Mutual Exclusion Requirements

5.1.1.1.

Safety Property

5.1.1.2.

Liveness Property

5.1.1.3.

Fairness Property

5.1.2.

Centralized Algorithm

5.1.2.1.

Coordinator Role

5.1.2.2.

Request Processing

5.1.2.3.

Single Point of Failure

5.1.3.

Distributed Algorithms

5.1.3.1.

Ricart-Agrawala Algorithm

5.1.3.1.1.

Request and Reply Protocol

5.1.3.1.2.

Message Complexity

5.1.3.1.3.

Fairness Analysis

5.1.3.2.

Maekawa's Algorithm

5.1.3.2.1.

Quorum-Based Approach

5.1.3.2.2.

5.1.3.2.3.

Deadlock Prevention

5.1.4.

Token-Based Algorithms

5.1.4.1.

Ring-Based Algorithm

5.1.4.2.

5.1.4.3.

Token Loss Handling

5.1.5.

Performance Comparison

5.1.5.1.

Message Complexity

5.1.5.2.

5.1.5.3.

Fault Tolerance

5.2.

Leader Election

5.2.1.

Election Problem Definition

5.2.1.1.

Uniqueness Property

5.2.1.2.

Agreement Property

5.2.1.3.

Termination Property

5.2.2.

Election Algorithms

5.2.2.1.

Bully Algorithm

5.2.2.1.1.

Election Process

5.2.2.1.2.

Coordinator Selection

5.2.2.1.3.

Failure Handling

5.2.2.2.

Ring-Based Election

5.2.2.2.1.

Token Circulation

5.2.2.2.2.

Leader Selection

5.2.2.2.3.

Ring Maintenance

5.2.3.

Election in Special Topologies

5.2.3.1.

Tree-Based Election

5.2.3.2.

Mesh Network Election

5.3.

Multicast Communication

5.3.1.

Multicast Models

5.3.1.1.

One-to-Many Communication

5.3.1.2.

Group Communication

5.3.1.3.

Scalability Issues

5.3.2.

Reliable Multicast

5.3.2.1.

Atomic Multicast

5.3.2.2.

Uniform Multicast

5.3.2.3.

Failure Handling

5.3.3.

Ordered Multicast

5.3.3.1.

5.3.3.2.

Causal Ordering

5.3.3.3.

5.3.4.

Multicast Algorithms

5.3.4.1.

Sequencer-Based Ordering

5.3.4.2.

Distributed Ordering Protocols

5.3.4.3.

Hybrid Approaches

5.3.5.

Group Management

5.3.5.1.

Group Membership

5.3.5.2.

Join and Leave Operations

5.3.5.3.

Failure Detection

Previous

4. Time and Global States

Go to top

Next

6. Consensus and Related Problems