ABOUT THE COURSE:This course is on Advanced Distributed Systems. It will start with epidemic and gossip based algorithms and then move on to peer-to-peer networks. The core focus in this part will be on distributed hash tables (DHTs). Then, the course will focus on theoretical aspects such as vector clocks, distributed leader election, the FLP result, and the CAP theorem. The last part of the course will focus on practical technologies such as the Paxos and RAFT consensus protocols, commit protocols, Bitcoin and blockchains, distributed file systems, and distributed programming languages.PRE-REQUISITES: Data structures (2nd year level), Operating SystemsINTENDED AUDIENCE: UG and PG students (Computer Science and Electrical Engineering)INDUSTRY SUPPORT: IBM, Amazon, Google, Microsoft
Overview
Syllabus
Week 1 : Epidemic and gossip based algorithms
Week 2 : Napster and Gnutella
Week 3 : DHTs: Chord, Pastry and BitTorrent
Week 4 : Logical clocks, Mutual Exclusion Algorithms
Week 5 : Distributed Leader Election
Week 6 : Distributed minimum spanning tree, the FLP result
Week 7 : Consistency models and the CAP theorem
Week 8 : Paxos and Raft
Week 9 : Byzantine General’s Problem, Virtual synchrony
Week 10 : Bitcoin and Blockchains
Week 11 : Amazon Dynamo, Facebook Cassandra, Google Percolator
Week 12 : Voldemort (LinkedIn), Condor, and Microsoft DryadLINQ
Taught by
Prof. Smruti Ranjan Sarangi
