Distributed Systems (IDSS : 3-0-1)
Venue: Room-5155, CC3 Building
Course Outline:
Introduction : Defining Distributed Systems, Goals and Challenges, Representation, Models of Distributed Systems Architecture Models of computation: Architecture Styles - Centralized and Decentralized architectural styles, Client-Server architecture - Application layering; Per to Peer Systems; Middleware : Message passing systems, synchronous and asynchronous systems; Remote procedure calls, Remote Method Invokation; Clock and Causal Ordering : Managing physical clocks in distributed systems; Logical clocks: Lamport's and vector clocks; Global state recording and Snapshot Algorithms; Clock synchronization, Leader election; Waves and Traversal; OS concepts : Distributed mutual exclusion - permission based algorithms, token based algorithms; Handling deadlocks; Event driven systems for asynchronous Distributed Systems; Resourse management : Distributed file systems; DFS examples: Hadoop; Distributed shared memory; Load distribution; Cloud computing, SOA; Fault tolerance and recovery : Fault models, agreement problems and its applications; Commit protocols, voting protocols; Checkpointing and recovery, Multicast communication;
1. George Coulouris Jean Dollimore, and Tim Kindberg,
Distributed Systems: Concepts and Design
[Download]
2. George Coulouris A.D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and Systems, ISBN: 9780521189842, paperback edition, Cambridge University Press, March 2011
[Download]
3. Nancy Lynch;
Distributed Algorithms,
4. Andrew S. Tanenbaum and Martan Van Steen, Distributed Systems, Principles and Paradigms
5. Mukesh Singhal and Niranjan Shivaratri , Advanced Concepts in Operating Systems
6. Jie Wu ,
Distributed Systems
o 1. Term examination : Mid-sem (30) and End-sem (75)
o
2. Project Assignment : The group assignments (max size - 4) will be uploaded on the website within the first week of commencement of classes
Project submission : Contact the TAs for the detailed problem statement of your project assignment and the milestones to be achieved during mid-sem and end-sem evaluation. Each group would be presenting their work in both mid-sem and end-sem and would be evaluated on the basis of the milestones assigned apriori.
If a student does not submit the assignments, his/her grade will remain as incomplete
2. Project Groups for the Course
3. Assignments on Map and Reduce
Assignment 1 : Facebook Friends
Assignment 2 : Sentiment Analysis in Twitter
Lectures:
Topic |
Slides |
Additional Resources |
Introduction |
||
Architecture Models |
||
Middleware |
||
Clock and Causal Ordering |
||
Global States of DS |
||
Distributed Mutual Exclusion |
||
Distributed File System |
||
Naming Service |
||
Case Study 1 |
||
Case Study 2 |