Distributed Computing Lesson Plan CS3551 JEC
Distributed Computing Lesson Plan CS3551 JEC
LESSON PLAN
Name : Vinothkumar V Designation : Assistant Professor
Course/Branch : B.Tech / AI&DS Subject Code : CS3551
Semester/Year : V/III –A Sec Subject Name : Distributed Computing
Course Coordinator : Vinothkumar V Regulation : R -2021
Batch : 2022-2026 LTPC : 3 0 0 3
Course Objectives
To impart knowledge about the following topics:
To introduce the computation and communication models of distributed systems
To illustrate the issues of synchronization and collection of information in distributed systems
To describe distributed mutual exclusion and distributed deadlock detection techniques
To elucidate agreement protocols and fault tolerance mechanisms in distributed systems
To explain the cloud computing models and the underlying concepts
Course outcomes
At the end of the course students will be able to:
C303.1: Explain the foundations of distributed systems (K2)
C303.2: Solve synchronization and state consistency problems (K3)
C303.3: Use resource sharing techniques in distributed systems (K3)
C303.4: Apply working model of consensus and reliability of distributed systems (K3)
C303.5: Explain the fundamentals of cloud computing (K2)
UNIT I – INTRODUCTION
SYLLABUS:
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.
UNIT OBJECTIVES:
To introduce the computation and communication models of distributed systems
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Introduction: Definition Black Board
1 02 12-08-2024 T1 1 C303.1
&Chalk
Relation to Computer System Black Board
2 05 13-08-2024 T1 2,3 C303.1
Components, Motivation &Chalk
Message, Systems versus Black Board
3 02 14-08-2024 T1 13 C303.1
Shared Memory Systems &Chalk
Primitives for Distributed Black Board
4 02 19-08-2024 T1 14 C303.1
Communication &Chalk
Synchronous versus Black Board
5 05 20-08-2024 T1 19 C303.1
Asynchronous Executions &Chalk
Design Issues and Challenges Black Board
6 02 21-08-2024 T1 22 C303.1
&Chalk
Model of Distributed
Computations: A Distributed 39, Black Board
7 03 22-08-2024 T1 C303.1
Program, A Model of 40 &Chalk
Distributed Executions
Models of Communication Black Board
8 04 22-08-2024 T1 42 C303.1
Networks &Chalk
Global State of a Distributed Black Board
9 02 26-08-2024 T1 43 C303.1
System &Chalk
SYLLABUS:
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.
UNIT OBJECTIVES:
To illustrate the issues of synchronization and collection of information in distributed systems
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Logical Time: Physical Clock Black Board
10 05 27-08-2024 T1 78 C303.2
Synchronization: NTP &Chalk
A Framework for a System of Black Board
11 02 28-08-2024 T1 52 C303.2
Logical Clocks &Chalk
Scalar Time, Vector Time 53, Black Board
12 03 29-08-2024 T1 C303.2
55 &Chalk
Message Ordering and Group 190, Black Board
13 04 29-08-2024 T1 C303.2
Communication 205 &Chalk
Asynchronous Execution with Black Board
14 02 02-09-2024 T1 195 C303.2
Synchronous Communication &Chalk
Synchronous Program Order on Black Board
15 05 03-09-2024 T1 200 C303.2
Asynchronous System &Chalk
Group Communication, Black Board
16 02 04-09-2024 T1 205 C303.2
&Chalk
Causal Order 206, Black Board
17 03 05-09-2024 T1 C303.2
Total Order 215 &Chalk
Global State and Snapshot
Black Board
18 Recording Algorithms: 04 05-09-2024 T1 87
&Chalk
C303.2
Introduction
System Model and Definitions,
90, Black Board
19 Snapshot Algorithms for FIFO 05 10-09-2024 T1
93 &Chalk
C303.2
Channels.
SYLLABUS:
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.
UNIT OBJECTIVES:
To describe distributed mutual exclusion and distributed deadlock detection techniques
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Distributed Mutual exclusion Black Board
20 04 12-09-2024 T1 305 C303.3
Algorithms: Introduction &Chalk
Preliminaries Black Board
21 04 19-09-2024 T1 306 C303.3
&Chalk
Lamport’s algorithm. Black Board
22 02 23-09-2024 T1 309 C303.3
&Chalk
RicartAgrawala’s Algorithm Black Board
23 05 24-09-2024 T1 312 C303.3
&Chalk
Token-Based Algorithms,
Black Board
24 Suzuki-Kasami’s Broadcast 02 25-09-2024 T1 336
&Chalk
C303.3
Algorithm
Deadlock Detection in
Black Board
25 Distributed Systems: 03 26-09-2024 T1 352
&Chalk
C303.3
Introduction
System Model Black Board
26 04 26-09-2024 T1 352 C303.3
&Chalk
Preliminaries Black Board
27 02 30-09-2024 T1 353 C303.3
&Chalk
Models of Deadlocks Black Board
28 05 01-10-2024 T1 355 C303.3
&Chalk
Chandy-Misra-Haas Algorithm
362, Black Board
29 for the AND model and OR 03 03-10-2024 T1
364 &Chalk
C303.3
Model
SYLLABUS:
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
UNIT OBJECTIVES:
To elucidate agreement protocols and fault tolerance mechanisms in distributed systems
Dates Text/Ref Page Teaching Course
S.No Topics Period
Planned Completed Books No. Methodology Outcomes
Consensus and Agreement Black Board
30 04 03-10-2024 T1 510 C303.4
Algorithms: Problem Definition &Chalk
Overview of Results Black Board
31 02 07-10-2024 T1 514 C303.4
&Chalk
Agreement in a Failure-Free
Black Board
32 System(Synchronous and 05 08-10-2024 T1 515
&Chalk
C303.4
Asynchronous)
Agreement in Synchronous Black Board
33 02 09-10-2024 T1 516 C303.4
Systems with Failures &Chalk
Checkpointing and Rollback Black Board
34 03 10-10-2024 T1 456 C303.4
Recovery: Introduction &Chalk
Background and Definitions Black Board
35 04 10-10-2024 T1 457 C303.4
&Chalk
Issues in Failure Recovery Black Board
36 05 15-10-2024 T1 462 C303.4
&Chalk
Checkpoint-based Recovery Black Board
37 04 17-10-2024 T1 464 C303.4
&Chalk
Coordinated Check pointing Black Board
38 05 22-10-2024 T1 476 C303.4
Algorithm &Chalk
Algorithm for Asynchronous Black Board
39 04 24-10-2024 T1 478 C303.4
Check pointing and Recovery &Chalk
TEXT BOOKS:
1. Kshemkalyani Ajay D, Mukesh Singhal, “Distributed Computing: Principles, Algorithms and
Systems”, Cambridge Press, 2011.
2. Mukesh Singhal, Niranjan G Shivaratri, “Advanced Concepts in Operating systems”, Mc-Graw
Hill Publishers, 1994
REFERENCE:
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.
4. Liu M L, “Distributed Computing: Principles and Applications”, Pearson Education, 2004.
5. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, 2003.
6. Arshdeep Bagga, Vijay Madisetti, “ Cloud Computing: A Hands-On Approach”, Universities
Press, 2014.
WEB RESOURCES:
https://www.geeksforgeeks.org/