7/18/25, 10:23 AM about:blank

K L Deemed to be University
CSE-1 -- KLVZA
Course Handout
2025-2026, Odd Sem
Course Title :DISTRIBUTED COMPUTING
Course Code :23CS4106
L-T-P-S Structure : 2-0-0-0
Pre-requisite :
Credits :2
Course Coordinator :Edupuganti Mounika
Team of Instructors :
Teaching Associates :
Syllabus :CO-1 Understand Primitives for Distributed Communication and , Logical time and Distributed
Graph Algorithms. CO-2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election. CO-3 Analyze distributed mutual
exclusion algorithms, and termination and deadlock detection in distributed systems. CO-4 Analyze
Consensus and Agreement Algorithms, Consistency and Replication, Fault Tolerance, and Self-Stabilization
in Distributed Systems.
Text Books :1 A.D. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and
Systems, Cambridge University Press, 2011 2 Tanenbaum, Andrew S Steen, Maarten van - Distributed
systems: principles and paradigms. Pearson, 4th Edition
Reference Books :1 George Coulouris, Jean Dollimore, Time Kindberg, “Distributed Systems Concepts
and Design”, Fifth Edition, Pearson Education, 2012. 2 Pradeep L Sinha, “Distributed Operating Systems:
Concepts and Design”, Prentice Hall of India, 2007 3 Tanenbaum A S, Van Steen M, “Distributed Systems:
Principles and Paradigms”, Pearson Education, 2007
MOOCS :1 [Link] 2 [Link]
distributed-computer-systems-engineering-spring-2006/ 3 [Link]
computer-systems-engineering-spring-2006/SSS
Course Rationale :This course introduces the fundamental architecture and communication paradigms in
distributed systems. Students learn to differentiate between parallel, distributed, shared memory, and
message-passing systems.
Course Objectives :Understand the fundamental concepts of distributed systems and Analyze and
implement time coordination and event ordering mechanisms.

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Understand Primitives for Distributed Communication and ,
CO1 PSO1,PO1,PO2 2
Logical time and Distributed Graph Algorithms.
Analyze causality, message ordering and group communication,
CO2 global state and snapshot recording algorithms, synchronizers, PSO1,PO1,PO2 4
and leader election.
Analyze distributed mutual exclusion algorithms, and
CO3 PSO2,PO1,PO2 4
termination and deadlock detection in distributed systems

about:blank 1/20
7/18/25, 10:23 AM about:blank

Analyze Consensus and Agreement Algorithms, Consistency

CO4 and Replication, Fault Tolerance, and Self-Stabilization in PSO2,PO1,PO2,PO3 4
Distributed Systems

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-2 COI-3 COI-4
No. BTL
Btl-2
Understand Primitives for
Distributed Communication
CO1 2
and , Logical time and
Distributed Graph
Algorithms.
Btl-2 Btl-4
Explain FIFO, causal, and Btl-3 Analyze the correctness and
total order message delivery Implement the bully and limitations of message
CO2 4 and describe how snapshot ring-based leader election ordering protocols and
algorithms like Chandy– algorithms in a simulated global snapshot algorithms
Lamport maintain global distributed environment. in the presence of non-FIFO
state consistency. channels.
Btl-4
Btl-2 Btl-3
Analyze the message
Explain the Chandy-Misra- Implement Lamport’s and
complexity and
Haas algorithm for deadlock Ricart-Agrawala’s
performance trade-offs
CO3 4 detection in AND and OR algorithms to achieve
among Suzuki–Kasami’s,
models and describe mutual exclusion in a
Raymond’s, and Maekawa’s
different models of distributed system
mutual exclusion
deadlocks. simulation.
algorithms.
Btl-3 Btl-4
Btl-2 Apply the Dolev–Israeli– Analyze the impact of
Describe self-stabilization Moran algorithm to failures in synchronous and
and explain the differences construct a self-stabilizing asynchronous message-
CO4 4
between data-centric and spanning tree and passing systems and
client-centric consistency demonstrate checkpointing evaluate agreement
models. and rollback in recovery protocols like distributed
scenarios. commit.

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po
Program Outcome
No.
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.
Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals,
PO1
and an engineering specialization to the solution of complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering
PO2 problems reaching substantiated conclusions using first principles of mathematics, natural sciences
and engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations

Lecture Course DELIVERY Plan:

about:blank 2/20
7/18/25, 10:23 AM about:blank

Book
Teaching-
No[CH
[Link]. CO COI Topic Learning EvaluationComponents
No][Page
Methods
No]

Definition, Relation to parallel

ALM,End Semester
multiprocessor/multicomputer
COI- T1: 1.1, Exam,Home
1 CO1 systems,Message Passing PPT,Talk
2 1.4, 1.5 Assignment,SEM-
Systems versus Shared Memory
EXAM1
Systems

ALM,End Semester
Primitives for Distributed
COI- T1: 1.6, Exam,Home
2 CO1 Communication,Synchronous PPT,Talk
2 1.7 Assignment,SEM-
and Asynchronous Execution
EXAM1

Distributed Graph Algorithms:

ALM,End Semester
Program structure, T1: 5.4,
COI- Exam,Home
3 CO1 Synchronous/Asynchronous 5.5.1, PPT,Talk
2 Assignment,SEM-
single-initiator spanning tree 5.5.2
EXAM1
algorithm

Asynchronous concurrent-
ALM,End Semester
initiator spanning tree
COI- T1: 5.5.3, Exam,Home
4 CO1 algorithm, Asynchronous PPT,Talk
2 5.5.4 Assignment,SEM-
concurrent-initiator depth first
EXAM1
search spanning tree algorithm.

ALM,End Semester
Minimum-weight spanning tree
COI- Exam,Home
5 CO1 (MST) algorithm in a T1: 5.11 PPT,Talk
2 Assignment,SEM-
synchronous system.
EXAM1

ALM,End Semester
Logical time: A framework for a
COI- T1: 3.2, Exam,Home
6 CO1 system of logical clocks, Scalar PPT,Talk
2 3.3 Assignment,SEM-
time
EXAM1

ALM,End Semester
Vector time, Matrix time,
COI- T1: 3.4, Exam,Home
7 CO1 Physical clock synchronization: PPT,Talk
2 3.7, 3.9 Assignment,SEM-
NTP.
EXAM1

Message Ordering and Group

ALM,End Semester
Communication: Message
COI- T1: 6.1, Exam,Home
8 CO2 ordering paradigms, Group PPT,Talk
2 6.4 Assignment,SEM-
communication, FIFO order,
EXAM1
Implementing FIFO Ordering

ALM,End Semester
COI- T1: 6.1, Exam,Home
9 CO2 Causal order (CO) PPT,Talk
2 6.4 Assignment,SEM-
EXAM1

10 CO2 COI- Total order, Propagation trees T1: 6.6, PPT,Talk ALM,End Semester
about:blank 3/20
7/18/25, 10:23 AM about:blank

Book
Teaching-
No[CH
[Link]. CO COI Topic Learning EvaluationComponents
No][Page
Methods
No]
2 for multicast. 6.8 Exam,Home
Assignment,SEM-
EXAM1

ALM,End Semester
Global State and Snapshot
COI- T1: 6.6, Exam,Home
11 CO2 Recording Algorithms: System PPT,Talk
2 6.8 Assignment,SEM-
model and definitions
EXAM1

ALM,End Semester
COI- Snapshot algorithms for FIFO T1: 4.2, Exam,Home
12 CO2 Chalk,PPT,Talk
3 channels 4.3 Assignment,SEM-
EXAM1

Variations of the Chandy–

Lamport algorithm: Helary’s ALM,End Semester
COI- wave synchronization method, T1: 4.4.3, Exam,Home
13 CO2 Chalk,PPT,Talk
3 Snapshot algorithms for non- 4.5.1 Assignment,SEM-
FIFO channels:Lai–Yang EXAM1
algorithm

Synchronizers, Leader election:

ALM,End Semester
The bully algorithm, A ring T1: 5.6,
COI- Exam,Home
14 CO2 algorithm, The Lelang, 5.10, T2: Chalk,PPT,Talk
3 Assignment,SEM-
Chang,and Roberts (LCR) 5.4
EXAM1
algorithm.

Deadlock detection in
distributed systems: T1: 10.2,
ALM,End Semester
Introduction, System Model , 10.3,
COI- Exam,Home
15 CO3 Preliminaries, Models of 10.4, Chalk,PPT,Talk
2 Assignment,SEM-
Deadlocks, Chandy-Misra-Haas 10.7,
EXAM2
Algorithm for the AND model 10.8
and OR Model.

Distributed mutual exclusion

ALM,End Semester
algorithms:Introduction, T1: 9.1,
COI- Exam,Home
16 CO3 Preliminaries, Lamport’s 9.2, 9.3, Chalk,PPT,Talk
3 Assignment,SEM-
algorithm, Ricart Agrawala’s 9.4
EXAM2
Algorithm

ALM,End Semester
COI- Exam,Home
17 CO3 Maekawa’s algorithm T1: 9.8 Chalk,PPT,Talk
3 Assignment,SEM-
EXAM2

Token-Based Algorithms: ALM,End Semester

T1: 9.10,
COI- Suzuki–Kasami’s broadcast Exam,Home
18 CO3 9.11, Chalk,PPT,Talk
3 algorithm, Raymond’s tree- Assignment,SEM-
9.12
based algorithm. EXAM2

about:blank 4/20
7/18/25, 10:23 AM about:blank

Book
Teaching-
No[CH
[Link]. CO COI Topic Learning EvaluationComponents
No][Page
Methods
No]

Termination detection:
ALM,End Semester
Termination detection using
COI- T1: 7.3, Exam,Home
19 CO3 distributed snapshots, Chalk,PPT,Talk
4 7.4, 7.5 Assignment,SEM-
Termination detection by weight
EXAM2
throwing,

ALM,End Semester
COI- A spanning-tree-based Exam,Home
20 CO4 T1: 7.5 Chalk,PPT,Talk
4 termination detection algorithm. Assignment,SEM-
EXAM2

Self-Stabilization in Distributed
ALM,End Semester
System:Definition of self-
COI- T1: 17.3, Exam,Home
21 CO4 stabilization, Issues in the Chalk,PPT,Talk
2 17.4 Assignment,SEM-
design of self-stabilization
EXAM2
algorithms,

Self-stabilizing distributed
ALM,End Semester
spanning trees, Self-stabilizing
COI- T1: 17.7, Exam,Home
22 CO4 algorithms for spanning-tree Chalk,PPT,Talk
2 17.8.1 Assignment,SEM-
construction:Dolev, Israeli, and
EXAM2
Moran algorithm

Consistency and Replication: ALM,End Semester

COI- Data-centric consistency T2: 7.2, Exam,Home
23 CO4 Chalk,PPT,Talk
3 models, Client-centric 7.3 Assignment,SEM-
consistency models. EXAM2

ALM,End Semester
COI- Exam,Home
24 CO4 Consistency protocols. T2: 7.5 Chalk,PPT,Talk
3 Assignment,SEM-
EXAM2

T2: 8.1, ALM,End Semester

Fault-Toleranence: Introduction
COI- 8.2.3, Exam,Home
25 CO4 to fault tolerance, Process Chalk,PPT,Talk
4 8.2.4, Assignment,SEM-
resilience.
8.2.5 EXAM2

Agreement in (message-
ALM,End Semester
passing) synchronous systems
COI- T1: 14.4, Exam,Home
26 CO4 with failures, Agreement in Chalk,PPT,Talk
4 14.5 Assignment,SEM-
asynchronous message-passing
EXAM2
systems with failures.

T2: 8.5, ALM,End Semester

Distributed commit,
COI- 8.6, T1: Exam,Home
27 CO4 Checkpointing and rollback Chalk,PPT,Talk
4 13.4, Assignment,SEM-
recovery
13.5 EXAM2

about:blank 5/20
7/18/25, 10:23 AM about:blank

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

Session Outcome: 1 Understand Primitives for Distributed Communication and , Logical time and
Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendace 1 Talk APPLICABLE
---
--- NOT
Message Passing Systems versus Shared Memory
20 2 PPT APPLICABLE
Systems
---
--- NOT
Message Passing Systems versus Shared Memory
20 2 PPT APPLICABLE
Systems
---
--- NOT
5 Summary 2 PPT APPLICABLE
---

SESSION NUMBER : 2

Session Outcome: 1 Understand Primitives for Distributed Communication and Synchronous/Asynchronous

Execution. Analyze Logical time and Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
20 Primitives for Distributed Communication,Synchronous 2 PPT APPLICABLE
---
--- NOT
20 Asynchronous Execution 2 PPT APPLICABLE
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 3

Session Outcome: 1 Understand Primitives for Distributed Communication and Synchronous/Asynchronous

Execution. Analyze Logical time and Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---

about:blank 6/20
7/18/25, 10:23 AM about:blank

--- NOT
Distributed Graph Algorithms: Program structure,
20 2 PPT APPLICABLE
Synchronous
---
--- NOT
20 Asynchronous single-initiator spanning tree algorithm 2 PPT APPLICABLE
---
--- NOT
20 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 4

Session Outcome: 1 Understand Primitives for Distributed Communication and Synchronous/Asynchronous

Execution. Analyze Logical time and Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
Asynchronous concurrent-initiator spanning tree
20 2 PPT APPLICABLE
algorithm
---
--- NOT
Asynchronous concurrent-initiator depth first search
20 2 PPT APPLICABLE
spanning tree algorithm.
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 5

Session Outcome: 1 Understand Primitives for Distributed Communication and Synchronous/Asynchronous

Execution. Analyze Logical time and Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 2 Talk APPLICABLE
---
--- NOT
20 Minimum-weight spanning tree (MST) 2 PPT APPLICABLE
---
--- NOT
Minimum-weight spanning tree (MST) algorithm in a
20 2 PPT APPLICABLE
synchronous system.
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 6

about:blank 7/20
7/18/25, 10:23 AM about:blank

Session Outcome: 1 Understand Primitives for Distributed Communication and Synchronous/Asynchronous

Execution. Analyze Logical time and Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
20 Logical time: A framework for a system of logical clocks 2 PPT APPLICABLE
---
--- NOT
20 Scalar time 2 PPT APPLICABLE
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 7

Session Outcome: 1 Understand Primitives for Distributed Communication and Synchronous/Asynchronous

Execution. Analyze Logical time and Distributed Graph Algorithms.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Quiz/Test
20 Vector time, Matrix time 2 PPT
Questions
Quiz/Test
20 Physical clock synchronization: NTP. 2 PPT
Questions
Quiz/Test
5 SUMMARY 2 PPT
Questions

SESSION NUMBER : 8

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Message Ordering and Group Communication: Message --- NOT
40 ordering paradigms, Group communication, FIFO order, 2 PPT APPLICABLE
Implementing FIFO Ordering ---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

about:blank 8/20
7/18/25, 10:23 AM about:blank

SESSION NUMBER : 9

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
40 Causal order (CO) 2 PPT APPLICABLE
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 10

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
40 Total order, Propagation trees for multicast. 2 PPT APPLICABLE
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 11

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
Global State and Snapshot Recording Algorithms:
40 2 PPT APPLICABLE
System model and definitions
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 12
about:blank 9/20
7/18/25, 10:23 AM about:blank

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Quiz/Test
20 Snapshot algorithms for FIFO channels 3 PPT
Questions
--- NOT
5 SUMMARY 3 PPT APPLICABLE
---

SESSION NUMBER : 13

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Variations of the Chandy–Lamport algorithm: Helary’s --- NOT
40 wave synchronization method, Snapshot algorithms for 3 PPT APPLICABLE
non-FIFO channels:Lai–Yang algorithm ---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 14

Session Outcome: 2 Analyze causality, message ordering and group communication, global state and
snapshot recording algorithms, synchronizers, and leader election.

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Quiz/Test
5 ATTENDANCE 1 Talk
Questions
Synchronizers, Leader election: The bully algorithm, A
Quiz/Test
40 ring algorithm, The Lelang, Chang,and Roberts (LCR) 3 PPT
Questions
algorithm.
Quiz/Test
5 SUMMARY 2 PPT
Questions

SESSION NUMBER : 15

Session Outcome: 3 Analyze distributed mutual exclusion algorithms, and termination and deadlock
detection in distributed systems

about:blank 10/20
7/18/25, 10:23 AM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Deadlock detection in distributed systems: Introduction,
--- NOT
System Model , Preliminaries, Models of Deadlocks,
40 2 PPT APPLICABLE
Chandy-Misra-Haas Algorithm for the AND model and
---
OR Model.
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 16

Session Outcome: 3 Analyze distributed mutual exclusion algorithms, and termination and deadlock
detection in distributed systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Distributed mutual exclusion algorithms:Introduction,
Quiz/Test
40 Preliminaries, Lamport’s algorithm, Ricart Agrawala’s 3 PPT
Questions
Algorithm
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 17

Session Outcome: 3 Analyze distributed mutual exclusion algorithms, and termination and deadlock
detection in distributed systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
40 Maekawa’s algorithm 3 PPT APPLICABLE
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 18

Session Outcome: 3 Analyze distributed mutual exclusion algorithms, and termination and deadlock
detection in distributed systems

about:blank 11/20
7/18/25, 10:23 AM about:blank

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
Token-Based Algorithms: Suzuki–Kasami’s broadcast
40 3 PPT APPLICABLE
algorithm, Raymond’s tree-based algorithm.
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 19

Session Outcome: 3 Analyze distributed mutual exclusion algorithms, and termination and deadlock
detection in distributed systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Termination detection: Termination detection using --- NOT
40 distributed snapshots, Termination detection by weight 4 PPT APPLICABLE
throwing, ---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 20

Session Outcome: 3 Analyze distributed mutual exclusion algorithms, and termination and deadlock
detection in distributed systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
Quiz/Test
5 ATTENDANCE 1 Talk
Questions
Quiz/Test
40 A spanning-tree-based termination detection algorithm. 4 PPT
Questions
Quiz/Test
5 SUMMARY 2 PPT
Questions

SESSION NUMBER : 21

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 12/20
7/18/25, 10:23 AM about:blank

--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Self-Stabilization in Distributed System:Definition of --- NOT
40 self-stabilization, Issues in the design of self-stabilization 2 Talk APPLICABLE
algorithms, ---
--- NOT
5 SUMMARY 2 Talk APPLICABLE
---

SESSION NUMBER : 22

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Self-stabilizing distributed spanning trees, Self- --- NOT
40 stabilizing algorithms for spanning-tree 2 PPT APPLICABLE
construction:Dolev, Israeli, and Moran algorithm ---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 23

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
Consistency and Replication: Data-centric consistency
40 3 PPT APPLICABLE
models, Client-centric consistency models.
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 24

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 13/20
7/18/25, 10:23 AM about:blank

--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
40 Consistency protocols. 3 PPT APPLICABLE
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 25

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
--- NOT
Fault-Toleranence: Introduction to fault tolerance,
40 4 PPT APPLICABLE
Process resilience.
---
--- NOT
5 SUMMARY 2 PPT APPLICABLE
---

SESSION NUMBER : 26

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 ATTENDANCE 1 Talk APPLICABLE
---
Agreement in (message-passing) synchronous systems --- NOT
40 with failures, Agreement in asynchronous message- 4 PPT APPLICABLE
passing systems with failures. ---
--- NOT
5 SUMMARY 4 PPT APPLICABLE
---

SESSION NUMBER : 27

Session Outcome: 4 Analyse Consensus and Agreement Algorithms, Consistency and Replication, Fault
Tolerance, and Self-Stabilization in Distributed Systems

Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods

about:blank 14/20
7/18/25, 10:23 AM about:blank

Quiz/Test
5 ATTENDANCE 1 Talk
Questions
Quiz/Test
40 Distributed commit, Checkpointing and rollback recovery 4 PPT
Questions
Quiz/Test
5 SUMMARY 2 PPT
Questions

Tutorial Course DELIVERY Plan: NO Delivery Plan Exists

Tutorial Session wise Teaching – Learning Plan

No Session Plans Exists

Practical Course DELIVERY Plan: NO Delivery Plan Exists

Practical Session wise Teaching – Learning Plan

No Session Plans Exists

Skilling Course DELIVERY Plan: NO Delivery Plan Exists

Skilling Session wise Teaching – Learning Plan

No Session Plans Exists

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment Assignment
Week Topic Details co
Type No
Weekly Message Passing Systems
Message Passing Systems versus
1 Homework 1 versus Shared Memory CO1
Shared Memory Systems
Assignments Systems
Consider a distributed
system with 5 nodes: P1,
P2, P3, P4, and P5,
Consider a distributed system with 5 connected in a logical ring.
nodes: P1, P2, P3, P4, and P5, The system needs to
connected in a logical ring. The capture a consistent global
system needs to capture a consistent state using Helary’s wave
global state using Helary’s wave synchronization method.
synchronization method. Node P1 Node P1 initiates the
Weekly
initiates the snapshot. Analyze how snapshot. Analyze how
4 Homework 2 CO2
Helary’s wave synchronization Helary’s wave
Assignments
method helps to capture a consistent synchronization method
global state in the above 5-node helps to capture a consistent
system. Illustrate the steps involved global state in the above 5-
in initiating and completing the node system. Illustrate the
snapshot, and discuss how messages steps involved in initiating
in transit are handled. and completing the
snapshot, and discuss how
messages in transit are
handled.
8 Weekly 3 Using a spanning-tree-based Using a spanning-tree- CO3
Homework termination detection algorithm, based termination detection
Assignments show how global termination is algorithm, show how global
about:blank 15/20
7/18/25, 10:23 AM about:blank

detected in a distributed system of termination is detected in a

five processes arranged in a tree distributed system of five
structure. Provide message flow and processes arranged in a tree
termination conditions. structure. Provide message
flow and termination
conditions.
Consider a distributed
network consisting of 7
nodes connected in a ring
Consider a distributed network
topology. Due to a transient
consisting of 7 nodes connected in a
fault, the local states of all
ring topology. Due to a transient
nodes are corrupted, and the
fault, the local states of all nodes are
original spanning tree is
corrupted, and the original spanning
lost. The system needs to
tree is lost. The system needs to
autonomously recover and
autonomously recover and
reconstruct a valid spanning
reconstruct a valid spanning tree.
tree. Using the Dolev,
Weekly Using the Dolev, Israeli, and Moran
Israeli, and Moran (DIM)
12 Homework 4 (DIM) self-stabilizing algorithm, CO4
self-stabilizing algorithm,
Assignments analyze how the system will
analyze how the system
eventually converge to a correct
will eventually converge to
spanning tree structure, even when
a correct spanning tree
all nodes start in an arbitrary state.
structure, even when all
Illustrate the behavior of at least
nodes start in an arbitrary
three nodes during this convergence
state. Illustrate the behavior
process, and highlight the key
of at least three nodes
properties that ensure self-
during this convergence
stabilization.
process, and highlight the
key properties that ensure
self-stabilization.

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
- - - - - - -
Theory -- --
- - - - - - -
- - - - - - -
Tutorial -- --
- - - - - - -
Mon
- - - - - - -
Lab -- --
- - - - - - -
- - - - - - -
Skilling -- --
- - - - - - -
Tue V-S201,V-S202,V-S203,V-S204,V- V-S201,V-S202,V-S203,V-S204,V-
- - - - - - - S205,V-S206,V-S207,V-S208,V- S205,V-S206,V-S207,V-S208,V-
Theory - - - - - - - S209,V-S210,V-S211,V-S212,V- S209,V-S210,V-S211,V-S212,V-
- - - - - - - S213,V-S214,V-S215,V-S216,V- S213,V-S214,V-S215,V-S216,V-
S217,V-S218,V-S219 S217,V-S218,V-S219
- - - - - - -
Tutorial - - - - - - - -- --
- - - - - - -

about:blank 16/20
7/18/25, 10:23 AM about:blank

- - - - - - -
Lab - - - - - - - -- --
- - - - - - -
- - - - - - -
Skilling - - - - - - - -- --
- - - - - - -
V-S101,V-S102,V-S103,V-S104,V- V-S101,V-S102,V-S103,V-S104,V-
- - - - - - - S105,V-S106,V-S107,V-S108,V- S105,V-S106,V-S107,V-S108,V-
Theory - - - - - - - S109,V-S110,V-S111,V-S112,V- S109,V-S110,V-S111,V-S112,V-
- - - - - - - S113,V-S114,V-S115,V-S116,V- S113,V-S114,V-S115,V-S116,V-
S117,V-S118,V-S119 S117,V-S118,V-S119
- - - - - - -
Tutorial - - - - - - - -- --
Wed - - - - - - -
- - - - - - -
Lab - - - - - - - -- --
- - - - - - -
- - - - - - -
Skilling - - - - - - - -- --
- - - - - - -
- - - - - - -
Theory -- --
- - - - - - -
- - - - - - -
Tutorial -- --
- - - - - - -
Thu
- - - - - - -
Lab -- --
- - - - - - -
- - - - - - -
Skilling -- --
- - - - - - -
- - - - - - -
Theory -- --
- - - - - - -
- - - - - - -
Tutorial -- --
- - - - - - -
Fri
- - - - - - -
Lab -- --
- - - - - - -
- - - - - - -
Skilling -- --
- - - - - - -
- - - - - - -
Theory -- --
- - - - - - -
- - - - - - -
Tutorial -- --
- - - - - - -
Sat
- - - - - - -
Lab -- --
- - - - - - -
- - - - - - -
Skilling -- --
- - - - - - -
- - - - - - -
Theory -- --
- - - - - - -
- - - - - - -
Tutorial -- --
- - - - - - -
Sun
- - - - - - -
Lab -- --
- - - - - - -
- - - - - - -
Skilling -- --
- - - - - - -
about:blank 17/20
7/18/25, 10:23 AM about:blank

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be
planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

[Link] Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and
schedule notified accordingly.
Advanced Topics, Additional Reading, Research
[Link] CO ALM References/MOOCS
papers and any

EVALUATION PLAN:

Evaluation Evaluation Assessment Duration

Weightage/Marks CO1 CO2 CO3 CO4
Type Component Dates (Hours)
End
Semester Weightage 40 10 10 10 10
End Semester
Summative 180
Exam
Evaluation Max Marks 100 25 25 25 25
Total= 40 %
In Semester Home Assignment Weightage 10 2.5 2.5 2.5 2.5
60
Formative and Textbook Max Marks 40 10 10 10 10
Evaluation Weightage 15 3.75 3.75 3.75 3.75
Total= 25 % ALM Max Marks 40
60
10 10 10 10
In Semester Semester in Weightage 17.5 8.75 8.75
90
Summative Exam-II Max Marks 50 25 25
Evaluation Semester in Weightage 17.5 8.75 8.75
Total= 35 % 90
Exam-I Max Marks 50 25 25

ATTENDANCE POLICY:

Every student is expected to be responsible for regularity of his/her attendance in class rooms and
laboratories, to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in
every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in
Semester end examination of the course, for cases of medical issues and other unavoidable circumstances the
students will be condoned if their attendance is between 75% to 85% in every course, subjected to
submission of medical certificates, medical case file and other needful documental proof to the concerned
departments

DETENTION POLICY :

about:blank 18/20
7/18/25, 10:23 AM about:blank

In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be
eligible for appearing to the Semester End Examination, failing to fulfill these conditions will deem such
student to have been detained in that course.

PLAGIARISM POLICY :

Supplement course handout, which may perhaps include special lectures and discussions

COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:

Supplement course handout, which may perhaps include special lectures and discussions
Chamber
Delivery Sections Chamber Chamber Signature
Consultation
Name of Faculty Component of Consultation Consultation of Course
Timings for
of Faculty Faculty Day (s) Room No: faculty:
each day
Suneetha Bandeela L 207-MA - - - -
219-
Vishnuvardhan
L MA,101- - - - -
Mannava
MA
PRASADA RAO P
L 103-MA - - - -
VRD
Mounika Valasapalli L 112-MA - - - -
Umamaheswararao
L 204-MA - - - -
Batta
Bala Namasivayam L 206-MA - - - -
Viswanathan Reddy L 209-MA - - - -
215-
Jagadish Gurrala L MA,116- - - - -
MA
Keerthi Samhitha
L 216-MA - - - -
Babu
104-
Miriyala
L MA,210- - - - -
Markandeyulu
MA
201-
Paladugu Rao L MA,114- - - - -
MA
B V N Prasad
L 106-MA - - - -
Paruchuri
214-
Sukham Singh L MA,115- - - - -
MA
KATAKAM 109-
VENKATESWARA L MA,202- - - - -
RAO MA
Veeramallu BOBBA L 208-MA - - - -
Suneetha Gudapati L 108-MA - - - -
211-
Talatoti Kumar L MA,105- - - - -
MA
Rohini Donepudi L 119-MA - - - -

about:blank 19/20
7/18/25, 10:23 AM about:blank

113-
MALLAMPATI
L MA,213- - - - -
MAHESH
MA
Kishan Kumar
L 203-MA - - - -
Penubaka
kunchala Krishna L 117-MA - - - -
217-
ASHOK
L MA,118- - - - -
KAKUMANU
MA
218-
ARUN
L MA,110- - - - -
PENUMUKKALA
MA
Siva Badipati L 107-MA - - - -
102-
Edupuganti Mounika L MA,205- - - - -
MA
212-
GAVINI PAVANI L MA,111- - - - -
MA

GENERAL INSTRUCTIONS

Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the
Course Faculty to the class.

NOTICES

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

(Edupuganti Mounika)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of CSE-1

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

about:blank 20/20