CS60002: Distributed Systems

From Metakgp Wiki
Jump to navigation Jump to search
CS60002
Course name Distributed Systems
Offered by Computer Science & Engineering
Credits 4
L-T-P 4-0-0
Prerequisites Algorithms-1, Operating Systems, Computer Networks
Previous Year Grade Distribution
8
6
9
1
2
3


EX A B C D P F
Semester Spring


Syllabus

Syllabus mentioned in ERP

Basic concepts. Models of computation: shared memory and message passing systems, synchronous and asynchronous systems. Logical time and event ordering. Global state and snapshot algorithms, mutual exclusion, clock synchronization, leader election, deadlock detection, termination detection, spanning tree construction. Programming models: remote procedure calls, distributed shared memory. Fault tolerance and recovery: basic concepts, fault models, agreement problems and its applications, commit protocols, voting protocols, checkpointing and recovery, reliable communication. Security and Authentication: basic concepts, Kerberos. Resource sharing and load balancing. Special topics: distributed objects, distributed databases, directory services, web services.References1.Mukesh Singhal and Niranjan Shivaratri, Advanced Concepts in Operating Systems, McGraw-Hill.2.Nancy Lynch, Distributed Algorithms, Morgan Kaufmann.3.Andrew S. Tanenbaum, Distributed Operating Systems, ACM Press.4.Jie Wu, Distributed Systems, CRC Press.5.Hagit Attiya, Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill.6.Sape Mullender (ed.), Distributed Systems, AddisonWesley.


Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources