Useful Links
Computer Science
Distributed Systems
Distributed Systems
1. Introduction to Distributed Systems
2. System Models and Architectures
3. Inter-Process Communication
4. Time and Global States
5. Coordination and Agreement
6. Consensus and Related Problems
7. Fault Tolerance and Reliability
8. Replication and Consistency
9. Distributed Data Storage
10. Distributed Transactions
11. Security in Distributed Systems
12. Modern Paradigms and Applications
Coordination and Agreement
Distributed Mutual Exclusion
Mutual Exclusion Requirements
Safety Property
Liveness Property
Fairness Property
Centralized Algorithm
Coordinator Role
Request Processing
Single Point of Failure
Distributed Algorithms
Ricart-Agrawala Algorithm
Request and Reply Protocol
Message Complexity
Fairness Analysis
Maekawa's Algorithm
Quorum-Based Approach
Voting Sets
Deadlock Prevention
Token-Based Algorithms
Ring-Based Algorithm
Token Passing
Token Loss Handling
Performance Comparison
Message Complexity
Response Time
Fault Tolerance
Leader Election
Election Problem Definition
Uniqueness Property
Agreement Property
Termination Property
Election Algorithms
Bully Algorithm
Election Process
Coordinator Selection
Failure Handling
Ring-Based Election
Token Circulation
Leader Selection
Ring Maintenance
Election in Special Topologies
Tree-Based Election
Mesh Network Election
Multicast Communication
Multicast Models
One-to-Many Communication
Group Communication
Scalability Issues
Reliable Multicast
Atomic Multicast
Uniform Multicast
Failure Handling
Ordered Multicast
FIFO Ordering
Causal Ordering
Total Ordering
Multicast Algorithms
Sequencer-Based Ordering
Distributed Ordering Protocols
Hybrid Approaches
Group Management
Group Membership
Join and Leave Operations
Failure Detection
Previous
4. Time and Global States
Go to top
Next
6. Consensus and Related Problems