Annexure ‘CD – 01’
L T P/S SW/FW No. of TOTAL
Course Title: Distributed System PSDA CREDIT
UNITS
Credit Units: 03 3 - - - 03
Course Level: UG
Course Code: CSE311
Course Objectives:
• To make student learn the properties of distributed algorithms, so called liveness and safety properties.
• Analyse different models of distributed systems, including failure and timing models
• Master basic algorithms for failure detection, leader elections, broadcast and multicast, basic shared memory in distributed systems, agreement
protocols, and group communication
• Practice in design and implementation of selected distributed algorithms in middleware designed for group communication.
Pre-requisites: Operating system, Computer Networks and Database system.
Course Contents/Syllabus:
Weightage (%)
Module I :
Characterization of Distributed Systems: Introduction, Examples of distributed Systems, Resource sharing and the
Web Challenges. System Models: Architectural models, Fundamental Models Theoretical Foundation for Distributed
System: Limitation of Distributed system, absence of global clock, shared memory, Logical clocks, Lamport’s & 20
vectors logical clocks, Causal ordering of messages, global state, termination detection. Distributed Mutual Exclusion:
Classification of distributed mutual exclusion, requirement of mutual exclusion theorem, Token based and non-token-
based algorithms, Performance metric for distributed mutual exclusion algorithms
Module II: 20
Distributed Deadlock Detection: system model, resource Vs communication deadlocks, deadlock prevention,
avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing
algorithms, edge chasing algorithms. Agreement Protocols: Introduction, System models, classification of Agreement
Problem, Byzantine agreement problem, Consensus problem, Interactive consistency Problem, Solution to Byzantine
Agreement problem, Application of Agreement problem, Atomic Commit in Distributed Database system.
Module III: 20
Distributed Objects and Remote Invocation: Communication between distributed objects, Remote
procedure call, Events and notifications, Java RMI case study. Security: Overview of security techniques,
Cryptographic algorithms, Digital signatures Cryptography pragmatics, Case studies: Needham Schroeder, Kerberos,
SSL& Millicent. Distributed File Systems: File service architecture, Sun Network File System, The Andrew File System,
Recent advances.
Module IV:
Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic Concurrency control,
Timestamp ordering, Comparison of methods for concurrency control. Distributed Transactions: Flat and nested
distributed transactions, Atomic Commit protocols, Concurrency control in distributed transactions, Distributed 20
deadlocks, Transaction recovery. Replication: System model and group communication, Fault - tolerant services, highly
available services, Transactions with replicated data.
Module V:
Distributed Algorithms: Introduction to communication protocols, Balanced sliding window protocol,
Routing algorithms, Destination based routing, APP problem, Deadlock free Packet switching, Introduction to Wave & 20
traversal algorithms, Election Algorithm, CORBA Case Study: CORBA RMI, CORBA services.
Course Learning Outcomes:
On the successful completion of the course, the student will be able to
• Apply problem solving (analysis, design, and development) skills to distributed applications.
• Establish knowledge of core architectural aspects of distributed systems.
• Identify problems relating to core components of distributed systems like file systems, RMI and security.
• Apply methods to support reliability and fault tolerance.
• Demonstrate established concepts of distributed systems.
• Select communication model and building distributed applications.
Pedagogy for Course Delivery:
Theory L/T (%) Lab/Practical/Studio (%)
The class will be taught using remote teaching methodology. Students’ learning and assessment will be on the basis of four quadrants and flipped class
method. E-content will be also provided to the students for better learning
Assessment/ Examination Scheme:
100 --
Theory Assessment (L&T):
Continuous Assessment/Internal Assessment End Term
(40 %) Examination
(60%)
Components (Drop Attendance Class Test Class Quiz HA
down)
Weightage (%) 5 15 10 10 60
Text & References:
1. Singhal&Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill.
2. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”, Pearson Ed.
3. Gerald Tel, "Distributed Algorithms", Cambridge University Press.
4. Andrew S. Tanenbaum and Maarten van Steen, Distributed Systems: Principles and Paradigms, Prentice