KNOWLEDGE INSTITUTE OF TECHNOLOGY, SALEM- 637 504

(Autonomous)
COURSE PLAN
CDDA
Name of the Faculty, Programme &
[Link],AP/IT [Link] – IT
Designation & Dept. Department of the Students
Academic Year, Semester &
Course Code & Name CS3351 – DISTRIBUTED COMPUTING 2024-25, V Sem
Section

1. COURSE OUTCOMES
Lab
Class
BT Tutorial Sessions/
On completion of the course, the students will be able to POs/PSOs KC Sessions
L (Hrs) Field visits
(Hrs)
(Hrs)
PO1, PO2, PO3, PO4, PO5,
CO1 Explain the foundations of distributed systems PO9, PO10, PO11, L2 C 8 -
PO12,PSO1,PSO2,PSO3
PO1, PO2, PO3, PO4, PO5,
CO2 Solve synchronization and state consistency problems PO9, PO10, PO11, L2 C 10 -
PO12,PSO1,PSO2,PSO3
PO1, PO2, PO3, PO4, PO5,
CO3 Use resource sharing techniques in distributed systems PO9, PO10, PO11, L2 C 10 -
PO12,PSO1,PSO2,PSO3
PO1, PO2, PO3, PO4, PO5,
Apply working model of consensus and reliability of
CO4 PO9, PO10, PO11, L3 P 10 -
distributed systems
PO12,PSO1,PSO2,PSO3
PO1, PO2, PO3, PO4, PO5,
Apply working model of consensus and reliability of
CO5 PO9, PO10, PO11, L3 P 7 -
distributed systems
PO12,PSO1,PSO2,PSO3
Total Hrs
BTL: Bloom Taxonomy Level ( L1: Remember, L2: Understand, L3; Apply, L4: Analyze, L5: Evaluate, L6: Create)
KC-Knowledge component ( F:Factual ,C: Conceptual, P:Procedural, MC: Meta-Cognitive)
Mapping of COs with POs, PSOs
COs /
POs & PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
PSOs
CO1 2 2 3 3 1 2 1 3 3 2 1 1
CO2 1 3 2 1 2 2 2 2 2 1 3 2
CO3 2 2 1 3 3 3 2 1 1 1 2 1
CO4 1 2 2 3 1 3 3 2 1 3 1 1
CO5 3 3 1 2 3 3 3 3 1 3 2 3
Avg. 1.8 2.4 1.8 2.4 2 2.6 2.2 2.2 1.6 2 1.8 1.6
1 – Low, 2 – Medium, 3 – High
 2 LECTURE PLAN
[Link]
Topic L T P SAS TLM R* Date
.
Unit 1- DISTRIBUTED COMPUTING: Introduction: Definition-Relation to Computer System
Components–Motivation– Message - Passing Systems versus Shared Memory Systems –
Primitives for Distributed Communication – Synchronous versus Asynchronous Executions –
Design Issues and Challenges; A Model of Distributed Computations:A Distributed Program– A
Model of Distributed Executions – Models of Communication Networks – Global State of a
Distributed System.
1 Relation to Computer System Components * M01 LWD
2 Motivation * M01 LWD
Message Passing Systems versus Shared M01 LWD
3 *
Memory Systems
4 Primitives for Distributed Communication * M01 LWD
5 Design Issues and Challenges * M02 HO
A Model of Distributed Computations, A M02 HO
6 *
Distributed Program
A Model of Distributed Executions, M02 HO
7 *
Models Of Communication Networks
8 Global State Of a Distributed System * M02 LWD
Assignment -1 (Submission: Before L12) M02 LWD
Unit 2-LOGICAL TIME AND GLOBAL STATE:
Logical Time: Physical Clock Synchronization: NTP – A Framework for a System of Logical
Clocks – Scalar Time – Vector Time; Message Ordering and Group Communication: Message
Ordering Paradigms – Asynchronous Execution with Synchronous Communication – Synchronous
Program Order on Asynchronous System – Group Communication – Causal Order – Total Order;
Global State and Snapshot Recording Algorithms: Introduction – System Model and Definitions –
Snapshot Algorithms for FIFO Channels.
Logical Time * M01 LWD
9
Physical Clock Synchronization * M01 LWD
10
Offset delay estimation method * M01 LWD
11
Definitions and Terminology * M01 LWD
12
Vector Time * M02 HO
13
Basic Properties * M02 HO
14
Message Ordering Paradigms * M02 HO
15
Asynchronous execution with synchronous * M02 LWD
16
communication
Synchronous program order on an * M02 LWD
17 asynchronous system, Group
Communication
Total Order, Global state and snapshot * M02 LWD
18
recording Algorithm
Unit 3 : DISTRIBUTED MUTEX AND DEADLOCK :
Distributed Mutual exclusion Algorithms: Introduction – Preliminaries – Lamport’s algorithm –
RicartAgrawala’s Algorithm – Token-Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm;
Deadlock Detection in Distributed Systems: Introduction – System Model – Preliminaries – Models
 of Deadlocks – Chandy-Misra-Haas Algorithm for the AND model and OR Model
Distributed Mutual exclusion Algorithms * M01 LWD
19
Preliminaries
Lamport’s algorithm * M01 LWD
20
RicartAgrawala’s Algorithm * M01 LWD
21
Suzuki-Kasami’s Broadcast Algorithm * M01 LWD
22
Deadlock Detection in Distributed * M01 LWD
23
Systems
System Model,Preliminaries * M02 LWD
24
Issues in deadlock detection * M02 LWD
25
26 Models of Deadlocks * M02 LWD

Chandy-Misra-Haas Algorithm for the * M02 LWD

27
AND model
Chandy-Misra-Haas Algorithm for the OR * M02 LWD
28
model
Unit 4: CONSENSUS AND RECOVERY :
Consensus and Agreement Algorithms: Problem Definition – Overview of Results – Agreement in
a Failure-Free System(Synchronous and Asynchronous) – Agreement in Synchronous Systems
with Failures; Checkpointing and Rollback Recovery: Introduction – Background and Definitions
– Issues in Failure Recovery – Checkpoint-based Recovery – Coordinated Checkpointing
Algorithm -- Algorithm for Asynchronous Checkpointing and Recovery
Consensus and Agreement Algorithms: * M01 LWD
29
Problem Definition
Overview of Results * M01 LWD
30

Agreement in a Failure * M01 LWD

31 Free System(Synchronous and
Asynchronous)
Agreement in Synchronous Systems with * M01 LWD
32
Failures;
Checkpointing and Rollback * M01 HO
33
Recovery: Introduction Background and * M02 HO
34
Definitions
Issues in Failure Recovery * M02 HO
35

Checkpoint-based Recovery * M02 LWD

36
Coordinated Checkpointing Algorithm * M02 LWD
37
Algorithm for Asynchronous * M02 LWD
38
Checkpointing and Recovery
UNIT V CLOUD COMPUTING
Definition of Cloud Computing – Characteristics of Cloud – Cloud Deployment Models – Cloud
Service Models – Driving Factors and Challenges of Cloud – Virtualization – Load Balancing –
Scalability and Elasticity – Replication – Monitoring – Cloud Services and Platforms: Compute
Services – Storage Services – Application Services
 * M01 LWD
39 Definition of Cloud Computing
* M01 LWD
40 Cloud Deployment Models
* M01 LWD
41 Virtualization
*
42 Scalability and Elasticity M02 LWD
*
43 Cloud Services and Platforms M02 LWD

44 Scalability and Elasticity * M02 LWD

45 Cloud Services and Platforms * M02 LWD

*R-Remarks
SAS Student Activity Sheet TLM Teaching Learning Methodology
LWD Lecture with Discussion HO Hands On
EL Experiential Learning (lab) PL Participative Learning
R1 Role Play R2 Flipped class, only Discussion in the class
R3 Discuss as a group(15 mins), and presentation by
R4 Video Screening, 15 mins, plus QA session
any 3 teams (7 min, each)
R5 Demonstration R6 Simulation based Discussion
R7 Factory Visit R8 Any Others (Specify)
2. STUDENT ACTIVITY SHEET

Student Activity Sheet (SAS)

Module: 01 Unit: 01 Lecture: 1 – 4
CO: CO1 PO: 1,2

Read T1 (pp.01-37)
YT Video (1), Topic: INTRODUCTION
Url: [Link]
View
YT Video (1), Topic: Message Passing Systems versus Shared Memory
Systems.
Url: [Link]
Expected Learning
Keywords*:Motivation, Design Issues, Distributed Program
Outcome
Assignment–A01(Part)
Prepare – NTA**
Prepare - TBA IAT – 1 (Part)
* The students have to attach 5W & 1H Questions with these Key words
and in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1. What is middleware?
Remarks
[Link] you mean by message passing system?
3. What is the role of middleware in a distributed system?
4. What are the advantages of Distributed system?
5. How Enlist the Characterization of distributed system?
 Student Activity Sheet (SAS)
Module: 02 Unit: 01 Lecture: 5-10
CO: CO1 PO: 1,2
T1 (pp.37-43)
Read

YT Video (1), Topic: Design Issues and Challenges

Url : [Link]
View
YT Video (1), Topic: Model of Distributed Executions
Url: [Link]
Expected Keywords*:
Learning Outcome Communication,Distributed Execution,Synchronous
Prepare - NTA Assignment –A01(Part)
Prepare - TBA IAT – 1 (Part)
* The students have to attach 5W & 1H Questions with these Key words and
in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1. What is model of communication networks?
Remarks [Link] you mean Local Ordering?
3. What is the role of middleware in a distributed system?
4. What are the advantages of Distributed data mining?
5. How Enlist the Application of distributed computing and newer
challenges?

Student Activity Sheet (SAS)

Module: 01 Unit: 02 Lecture: 11– 14
CO: CO2 PO: 1,2
T1 (pp.50-78)
Read
YT Video (1), Topic: Message Ordering Paradigms
View Url: [Link]
Video (2), Topic: Synchronous program order on an asynchronous system
Url:[Link]
Expected Learning
Keywords*:Terminology, Vector Time, Total Order
Outcome
Prepare – NTA** Assignment –A01(Part)

Prepare - TBA IAT – 1 (Part)

* The students have to attach 5W & 1H Questions with these Key words
and in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1. What is logical time?
Remarks
[Link] you mean by Vector Time?
3. What is the role of Synchronous program?
4. What are the advantages of Total Order?
5. How Enlist the Offset delay estimation method?

Student Activity Sheet (SAS)

 Module: 02 Unit: 02 Lecture: 15-20
CO: CO2 PO: 1,2

Read T1-Pg: (72-102, 113-132) , R2- Pg: (56-101)

YT Video (1), Topic: Vector clock

Url : [Link]
View
YT Video (1), Topic: Model of Distributed Executions
Url: [Link]
Expected
Keywords*:Communication,Distributed Execution,Synchronous
LearningOutcome
Assignment –A01(Part)
Prepare - NTA

Prepare - TBA IAT – 1 (Part)

* The students have to attach 5W & 1H Questions with these Key words and
in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1. What is model of communication networks?
Remarks [Link] you mean Local Ordering?
3. What is the role of middleware in a distributed system?
4. What are the advantages of Distributed data mining?
5. How Enlist the Application of distributed computing and newer
challenges?

Student Activity Sheet (SAS)

Module: 01 Unit: 03 Lecture: 29–33
CO: CO3 PO: 1,2,3,4,5

T1- Pg: (10-16, 20-26) ; R2-Pg: (02-21)

Read
YT Video (1), Topic: Lamport’s algorithm
View Url: [Link]
Topic: Suzuki-Kasami’s Broadcast Algorithm.
Url: [Link]
ExpectedLearning Keywords*:Preliminaries, Lamport’s Algorithms,Suzuki-Kasami’s Broad
Outcome Systems.
Open Ended (Part)
Prepare – NTA**

Prepare – TBA IAT – 1 (Part)

* The students have to attach 5W & 1H Questions with these Key words
and in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1. What is Lampart algorithm?
Remarks
2. When Ricart Agrawala’s Algorithm is used?
[Link] is the Suzuki-Kasamis’s algorithm typically used?
4. Why Distributed Mutual exclusion Algorithmsis need?
[Link] does the Lampart algorithm work?

Student Activity Sheet (SAS)

Module: 02 Unit: 03 Lecture: 7-9
 CO: CO1 PO: 1,2

Read T1-Pg: (72-102, 113-132) , R2- Pg: (56-101)

YT Video (1), Topic: Chandy-Misra-Haas Algorithm for the AND model

Url : [Link]
View
YT Video (1), Topic: Chandy-Misra-Haas Algorithm for the OR model
Url: [Link]
Expected
Keywords*:Deadlock, System models
LearningOutcome
Open Ended(Part)
Prepare - NTA

Prepare - TBA IAT – 2 (Part)

* The students have to attach 5W & 1H Questions with these Key words and
in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
[Link] deadlock condition arises?
Remarks
[Link] are the issues in deadlock?
[Link] we can use the Chandy-Misra-Haas Algorithm for the AND model?
[Link] is Chandy-Misra-Haas Algorithm for the OR model?
[Link] is system models?

Student Activity Sheet (SAS)

Module: 01 Unit: 04 Lecture: 29–33
CO: CO3 PO: 1,2,3,4,5

T1- Pg: (65-70) ; R2-Pg: (02-21)

Read
YT Video (1), Topic: Consensus and Agreement Algorithms
View Url: [Link] Topic:
Consensus and Agreement Algorithms.
Url: [Link]
ExpectedLearning Keywords*:Preliminaries, Lamport’s Algorithms,Suzuki-Kasami’s Broad
Outcome Systems.
Open Ended
Prepare – NTA**
Prepare – TBA IAT – 2 (Part)
* The students have to attach 5W & 1H Questions with these Key words
and in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1. what is meant by Consensus
Remarks 2. What is Aggrement failure?
[Link] is Model-based Communication-induced check pointing?
4. What are the failures in Distributed Systems?
[Link] does the garbage collection algorithm
based on a rollback dependency graph work
6. what is meant by Consensus

Student Activity Sheet (SAS)

Module: 02 Unit: 04 Lecture: 33-38
 CO: CO1 PO: 1,2

Read T1-Pg: (80-89) , R2- Pg: (56-101)

YT Video (1), Topic: Recovery

View Url : [Link] YT Video (1),
Topic: Checkpointing & Rollback Recovery
Url: [Link]
Expected
Keywords*:Recovery, Checkpoint
LearningOutcome
Open Ended
Prepare - NTA

Prepare - TBA IAT – 2 (Part)

* The students have to attach 5W & 1H Questions with these Key words and
in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1What is a recovery line?

How does the garbage

2.

collection algorithm
based on a rollback
Remarks dependency graph work
[Link] does the garbage collection algorithmbased on a rollback
dependency graph ?

Mention the types of

3.

rollback recovery
schemes.
[Link] the types of rollback recovery schemes work.
[Link] is Byzantine Agreement?
[Link] many types of recovery?

Student Activity Sheet (SAS)

Module: 01 Unit: 05 Lecture: 39-41
CO: CO3 PO: 1,2,3,4,5

R1-Pg: (21-31)
Read
YT Video (1), Topic: Cloud Deployment Models
View Url : [Link]
Topic: Virtualization
Url: [Link]
ExpectedLearning
Keywords*:Deployment, Virtualization,Cloud Models
Outcome
Prepare – NTA** Open Ended
Prepare – TBA IAT – 2 (Part)
* The students have to attach 5W & 1H Questions with these Key words
and in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
Remarks 1. What is Cloud Computing?
2. What is Virtualization?
[Link] is Cloud Balancing?
4. What are the advantages of pay per usage in cloud?
[Link] to differentiate private and public cloud?

Student Activity Sheet (SAS)

Module: 02 Unit: 04 Lecture: 42-45
CO: CO1 PO: 1,2

Read R1-Pg: (41-71)

YT Video (1), Topic: Cloud Services and Platforms

Url [Link]
View
Topic: Scalability and Elasticity
Url: [Link]
Expected
Keywords*: Cloud Recovery, Cloud Essentials
LearningOutcome

Prepare - NTA Open Ended

Prepare - TBA IAT – 2 (Part)

Remarks * The students have to attach 5W & 1H Questions with these Key words and
in a position to answer.
[5W & 1H : What, When, Where, Who, Why, How]
1What is the need of Virtualization?

How does the garbage

2.

collection algorithm
based on a rollback
dependency graph work
[Link] are the functions of Network Virtualization?

[Link] the types of

 rollback recovery
schemes.
[Link] are the Characteristics of Virtualization?
[Link] is Storage Virtualization?
[Link] Virtual Machines can be ensure the security purposes?

**Max. 2 NTA can be planned for Course.

3. INNOVATIVE TEACHING LEARNING METHODOLOGY(I-TLM)

* I-TLM Planned Actual

[Link] Learning (Min. one Period/
COs Session Outcome Month &
. Space methodology/CO Date Duratio
Week
) n
Assemble the parts of Half August&
1. CO1 wave and full wave rectifier Laboratory Demonstration Second
power supply week
Sep&
Manage to do self-learning
2. CO4 Class room Flipped Class Third
based on given content.
week

*Methods -Industrial Expert Lecture, ICT usage, Field Visit, Guest Lecture, Demonstration, Tutorial, Online
Quiz, Hands-on training, Activity based learning, Assignment, Seminar, Mini projects, etc.,

4. ASSESSMENT PATTERN (R2023)- Sample

Total
CO wise Mark Distribution Cognitive Process Levels
Mark Split up Mark
(%) Distribution in Percentage
s

Direct Total
Sections/ Part CO CO CO CO CO L L L L L
Assessme Part B Mark L4
Tests A 1 2 3 4 5 1 2 3 5 6
nt s
IAT - 1 20 80 50 100
IAT - 2 20 80 50 100
Other
Assessme
nt 1
20 40
(NTA)*
Other 20 40
Assessme
nt 2
(NTA)*
 ESE** 40 60 100 100
Indirect Course
Assessme End Set of Questionaries with
-
nt Survey rubrics-based assessment
(CES)

* As per R2023, any one of 3 cases can be followed based on the preference of course faculty.
** Faculty can enter the Cognitive Process Levels Distribution in Percentage after the completion of End
Semester Examination.