Course

Unit 1

Introduction to Distributed Systems,Distributed System Architecture,Networking – Layering, Switching,Routing, Congestion Control.Inter-Process Communication –Socket, RPC, Message-passing and multi-cast.

Unit 2

Logical Time -Basic properties, types .Implementation of vector clocks. Global state and snapshots-Chandys Lamport Algorithm,Non-FIFO channels.Distributed mutual exclusion-Lamports algorithm.Deadlock detection -Models.Termination detection-system model.

Unit 3

Distributed file systems – replica management ,concurrency control,load balancing.Fault tolerance – models,committ protocols,voting protocols.Consensus problem.Self-stabilization -defenition,issues.

Objectives

The course introduces the basic principles governing the design and implementation of various schemes in developing a distributed computing system.
The course aims to provide provide practical insights to various methedologies involved in distributed systems.

Course Outcomes
CO1 : Explain the design principles governing distributed systems.
CO2 : Implement the various communication algorithms in distributed algorithms.
CO3: Analyze the various resource management schemes in distributed environment.
CO4: Evaluate the issues involved in distributed data management.

CO & PO mapping

1. Andrew S. Tannenbaum and Maarten van Steen, Distributed Systems: Principles and Paradigms, Third Edition,
   Prentice Hall, 2017.
2. Ajay D. Kshemkalyani and Mukesh Singhal, Distributed Computing: Principles, Algorithms, and Systems, CambridgeUniversity Press, 2011.

1. Garg VK, Garg VK. Elements of distributed computing. John Wiley & Sons; 2002.
2. George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Blair, Distributed Systems: Concepts and Design, Fifth Edition, Pearson Education, 2017.