Distributed Computing - 3B - LESSON PLAN - 2023 - 2024 Odd Sem
Distributed Computing - 3B - LESSON PLAN - 2023 - 2024 Odd Sem
DEFINITION:
Distributed computing is a model in which components of a software system are shared among multiple computers or nodes. Even though the software
components may be spread out across multiple computers in multiple locations, they're run as one system. This is done to improve efficiency and
performance. The systems on different networked computers communicate and coordinate by sending messages back and forth to achieve a defined
task. Distributed computing can increase performance, resilience and scalability, making it a common computing model in database and application
design.
COURSE OBJECTIVES:
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:
Upon the completion of this course, the student will be able to
CO1: Explain the foundations of distributed systems (K2)
CO2: Solve synchronization and state consistency problems (K3)
CO3 Use resource sharing techniques in distributed systems (K3)
CO4: Apply working model of consensus and reliability of distributed systems (K3)
CO5: Explain the fundamentals of cloud computing (K2)
CS3551 DISTRIBUTED COMPUTING LTPC 3003
UNIT I INTRODUCTION 8
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.
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.
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.
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 V CLOUD COMPUTING 7
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
OPEN SOURCES:
OS1: https://www.youtube.com/watch?v=wiBWIdV8Eec
OS2: https://www.youtube.com/watch?v=af9hZMiEe5U
OS3: https://www.youtube.com/watch?v=XRkv77EhKUo
OS4: https://www.youtube.com/watch?v=wiBWIdV8Eec&t=84s
OS5: https://www.youtube.com/watch?v=PTuwsfq_5fo
0S6: https://www.youtube.com/watch?v=EcoTlY0GXrA
0S7: ttps://www.youtube.com/watch?v=XQh2_zV4Dnc
TEACHING PLAN
S.
Proposed Actual Use of teaching Teaching Reference
N Topic to be Covered Cognitive level
Date Date Tool Methodology Material Remarks
o
Unit I-INTRODUCTION
Definition –Relation to
1 19-07-23 Remember Black Board Lecture T1
computer system components
2 Motivation, Message-passing 20-07-23 Understand Black Board Lecture T1
systems versus shared memory
systems
Synchronous versus
4 Asynchronous Executions 07-08-23 Understand Black Board Lecture T1
Demonstratio
11 NTP 17-08-23 Understand Visual Aids Online Source OS2
n
A Framework for a System of
12 18-08-23 Understand Black Board Lecture T1
Logical Clocks
Scalar Time – Vector Time
13 21-08-23 Understand Black Board Lecture T1
14 Message ordering and group 22-08-23 Understand Black Board Lecture T1
communication
15 23-08-23 Understand Black Board Lecture T1
Message ordering paradigms –
Asynchronous
16 execution with synchronous 24-08-23 Apply Black Board Lecture T1
communication
Synchronous program order on
17 an asynchronous 25-08-23 Apply Black Board Lecture T1
system
Group communication Understand Black Board Lecture T1
18 28-08-23
Demonstratio
19 Causal order (CO),Total order 29-08-23 Visual Aids/ PPT Online Source OS3
Understand n
Global state and snapshot Demonstratio
20 04-09-23 Visual Aids/ PPT Online Source OS4
recording algorithms Apply n
Introduction –System model and
21 05-09-23 Understand Black Board T1,T2
definitions Lecture
OS5
Snapshot algorithms for Demonstratio
22 07-09-23 Apply Visual Aids/ PPT Online Source
FIFO channels n
Unit III - DISTRIBUTED MUTEX & DEADLOCK
Distributed Mutual exclusion
23 Algorithms: Introduction– 08-09-23 Understand Black Board Lecture T1
Preliminaries
24 Lamport’s algorithm 09-09-23 Apply Black Board Lecture T1
RicartAgrawala’s Algorithm Apply
25 11-09-23 Visual Aids/ PPT Demonstration Online Source OS6
26 Token-Based Algorithms 12-09-23 Apply Black Board Lecture T1
Suzuki-Kasami’s Broadcast
27 13-09-23 Apply Black Board Lecture T1
Algorithm
Deadlock detection in Apply
28 14-09-23 Flipped Learning
distributed systems
29 System model – Preliminaries 15-09-23 Understand Black Board Lecture T1
Models of Deadlocks
30 18-09-23 Understand Black Board Lecture T1
Chandy-Misra-Haas Algorithm
31 for the AND model and OR 19-09-23 Apply Black Board Lecture T1
Model
Chandy-Misra-Haas Algorithm
for the AND model and OR Apply Black Board Lecture T1
32 20-09-23
Model
43 Definition of Cloud Computing 05-10-23 Understand Visual Aids/PPT Demonstration Online Source
Characteristics of Cloud Cloud
44 Deployment Models – Cloud 06-10-23 Understand Visual Aids/PPT Demonstration Online Source
Service Models –
45 Driving Factors and Challenges 16-10-23 Understand Visual Aids/PPT Demonstration Online Source
of Cloud – Virtualization
Load Balancing – Scalability
46 and Elasticity Replication – 17-10-23 Understand Black Board Lecture T1
Monitoring
47 Cloud Services and Platforms: 18-10-23 Understand Black Board Lecture T1
Compute Services –
48 Storage Services 19-10-23 Understand Black Board Brainstorming Online Source
49 Application Services 20-10-23 Understand Black Board Lecture T1
CONTENT BEYOND THE SYLLABUS
21-10-23
52 Torrent file system Understand Visual Aids Demonstration Online Source
Hadoop file system 25-10-23 Understand Visual Aids Demonstration Online Source
53
Faculty In-Charge HOD IQAC - Head