Skip to content

Latest commit

 

History

History
11 lines (9 loc) · 521 Bytes

README.md

File metadata and controls

11 lines (9 loc) · 521 Bytes

Distributed Hash Table

For UIUC Cloud Computing Concept courses on Coursera

Part 1: Gossip Membership Protocol: Completeness all the time (every non-faulty process detects every node join, failure, and leave) Accuracy of failure detection (when there are no message losses and message delays are small)

Part 2: Fault-Tolerant Key Value Store A key-value store supporting CRUD operations, Load-balancing, Quorum consistency level for both reads and writes, and Stabilization after failure