T.J.
S ENGINEERING COLLEGE
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai.
Accredited by NAAC / ISO 9001:2015 Certified Institution TJS
Nagar, Peruvoyal, Near Kavaraipettai, Gummidipoondi Taluk,
Thiruvallur District -601 206.
Ph: 044 27967600, E-mail: [email protected], Web: www.tjsec.in
CS3551 Distributed Computing
TJS/CSE/LP
T.J.S ENGINEERING COLLEGE
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai.
Accredited by NAAC / ISO 9001:2015 Certified Institution TJS
Nagar, Peruvoyal, Near Kavaraipettai, Gummidipoondi Taluk,
Thiruvallur District -601 206.
Ph: 044 27967600, E-mail: [email protected], Web: www.tjsec.in
Course Information Sheet
Programme: Computer Science And Degree: B E
Engineering
Course: Distributed Computing Semester: 5 Credits: 3
Course Code: CS3551 Course Type: Core
Regulation: 2021
Course Area/Domain: Cloud Contact Hours: 3 Hours/Week.
Corresponding Lab Course Code (If Lab Course Name: - NIL
Any): NIL
Syllabus:
Unit Details Hours
Unit I Introduction
Introduction: Definition-Relation To Computer System Components –
Motivation – Message -PassingSystems Versus Shared Memory Systems –
I Primitives For Distributed Communication – 8
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 II 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
II Paradigms – Asynchronous Execution With Synchronous Communication – 10
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.
III Unit III Distributed Mutex And Deadlock 10
Distributed Mutual Exclusion Algorithms: Introduction – Preliminaries –
Lamport’s Algorithm – Ricartagrawala’s Algorithm –– Token-Based
Algorithms – Suzuki-Kasami’s Broadcast Algorithm; Deadlock Detection In
TJS/CSE/LP
Distributed Systems: Introduction – System Model – Preliminaries – Models
Of Deadlocks – Chandy-Misra-Haas Algorithm For The And Model And Or
Model.
Unit IV Consensus And Recovery
Consensus And Agreement Algorithms: Problem Definition – Overview Of
Results – Agreement In A
Failure-Free System(Synchronous And Asynchronous) – Agreement In
IV Synchronous Systems With 10
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
Definition Of Cloud Computing – Characteristics Of Cloud – Cloud
Deployment Models – Cloud
V Service Models – Driving Factors And Challenges Of Cloud – Virtualization
7
– Load Balancing – Scalability And Elasticity – Replication – Monitoring –
Cloud Services And Platforms: Compute Services – Storage Services –
Application Services
Total Hours 45
Text/Reference Books:
T/ Book Title/Authors/Publication
R
1. Kshemkalyani Ajay D, Mukesh Singhal, “Distributed Computing: Principles,
T Algorithms And Systems”, Cambridge Press, 2011
2. Mukesh Singhal, Niranjan G Shivaratri, “Advanced Concepts In Operating
T Systems”, Mcgraw Hill Publishers, 1994
1. George Coulouris, Jean Dollimore, Time Kindberg, “Distributed Systems Concepts
R And
Design”, Fifth Edition, Pearson Education, 2012.
R Technical Publication
Course Pre-Requisites:
C.Code Course Name Description Sem
Nil
TJS/CSE/LP
Course Objectives:
1 To introduce the computation and communication models of distributed
system
2 To illustrate the issues of synchronization and collection of information in
distributed systems
3 To describe distributed mutual exclusion and distributed deadlock
detection techniques
4 To elucidate agreement protocols and fault tolerance mechanisms in
distributed systems
Course Outcomes:
Po & Pso
Sno Description
Mapping
1 Explain the foundations of distributed systems (K2) Po5,Po3,Po2, Pso3
2 Solve synchronization and state consistency Po3,Po2,Po5, Pso3
problems (K3)
3 Use resource sharing techniques in distributed Po2,Po3,Po5, Pso3
systems (K3)
4 Apply working model of consensus and reliability Po3,Po2.Po5, Pso3
of distributed systems (K3)
5 Explain the fundamentals of cloud computing (K2) Po3,Po2.Po5
Gaps In The Syllabus - To Meet Industry/Profession Requirements:
Sno Description Proposed Actions
1 Creating Vitrual Machine To Learn Ethical Live Demo And Practical
Hacking Session To Learn And
Perform Ethical Hacking
Proposed Actions: Topics Beyond Syllabus/Assignment/Industry Visit/Guest
Lecturer/Nptel Etc
Topics Beyond Syllabus/Advanced Topics/Design:
1 Ethical Hacking
TJS/CSE/LP
T.J.S ENGINEERING COLLEGE
T.J.S
Approved ENGINEERING COLLEGE
by AICTE, New Delhi & Affiliated to Anna University, Chennai.
Approved by AICTE,by
Accredited New Delhi
NAAC & Affiliated
/ ISO 9001:2015 toCertified
Anna University, Chennai.
Institution TJS
Nagar, Peruvoyal,
Accredited byNear
NAACKavaraipettai,
/ ISO 9001:2015Gummidipoondi Taluk, TJS
Certified Institution
Nagar, Peruvoyal, Near Kavaraipettai,
Thiruvallur Gummidipoondi
District -601 206. Taluk,
Thiruvallur
Ph: 044 27967600, E-mail: District -601 206. Web: www.tjsec.in
[email protected],
Ph: 044 27967600, E-mail: [email protected], Web: www.tjsec.in
Delivery/Instructional Methodologies:
☐ Chalk & Talk ☐ Stud. ☐ Web Resources
Assignment
☐ Lcd/Smart ☐ Stud. Seminars ☐ Add-On
Boards Courses
Assessment Methodologies-Direct
☐ Assignments ☐ Stud. Seminars ☐ Tests/Model ☐ Univ.
Exams Examination
☐ Stud. Lab ☐ Mini/Major
Practices ☐ Stud. Viva Projects ☐Certifications
☐ Add-On
Courses ☐ Others
Assessment Methodologies-Indirect
☐ Assessment Of Course Outcomes ☐ Student Feedback On
(By Feedback, Once) Faculty (Twice)
☐ Assessment Of Mini/Major
Projects By Ext. Experts ☐ Others
Prepared By Approved By
TJS/CSE/LP
Course Plan
Unit I Introduction
Introduction: Definition-Relation To Computer System Components – Motivation – Message -
PassingSystems 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.
Planed
Session Teaching Actual
Date And Topics To Be Covered
No. Method Date
Hour
Introduction: Definition-Relation To
1. Bb/Ppt
Computer System Components g
Motivation – Message - Bb/Ppt
2.
Primitives For Distributed Bb/Ppt
3. Communication –
Design Issues And Challenges; A Model Bb/Ppt
Of Distributed Computations: A
4.
Distributed Program
A Model Of Distributed Executions – Bb/Ppt
5. Models Of Communication Networks
Global State Of A Distributed System Bb/Ppt
6.
Passing Systems Versus Shared Memory Bb/Ppt
7. Systems
Synchronous Versus Asynchronous Bb/Ppt
8. Executions
TJS/CSE/LP
Unit II 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.
Planned
Session Date Teaching Actual
Topics To Be Covered
No. And Method Date
Hour
Logical Time: Physical Clock Bb/Ppt
1. Synchronization: Ntp
A Framework For A System Of Logical Bb/Ppt
2. Clocks – Scalar Time
Vector Time; Message Ordering And Bb/Ppt
Group Communication: Message
3.
Ordering Paradigms
Asynchronous Execution With Bb/Ppt
4. Synchronous Communication
Synchronous Program Order On Bb/Ppt
5. Asynchronous System
Group Communication Bb/Ppt
6.
Causal Order – Total Order; Bb/Ppt
7.
Global State And Snapshot Recording Bb/Ppt
8. Algorithms
Introduction – System Model And Bb/Ppt
9. Definitions
TJS/CSE/LP
Snapshot Algorithms For Fifo Channels. Bb/Ppt
10.
Unit III Distributed Mutex And Deadlock
Distributed Mutual Exclusion Algorithms: Introduction – Preliminaries – Lamport’s Algorithm –
Ricartagrawala’s Algorithm –– Lamport’s Algorithm – Ricartagrawala’s Algorithm – 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.
Session Taken Teaching Actual
Topics To Be Covered
No. Date Method Date
Distributed Mutual Exclusion Algorithms:
1. Bb/Ppt
Introduction
Preliminaries Bb/Ppt
2.
Lamport’s Algorithm – Ricartagrawala’s Bb/Ppt
3. Algorithm
Lamport’s Algorithm – Ricartagrawala’s Bb/Ppt
4. Algorithm
Suzuki-Kasami’s Broadcast Algorithm Bb/Ppt
5.
Deadlock Detection In Distributed Systems: Bb/Ppt
6. Introduction
Introduction – System Model
7.
Preliminaries
8.
Models Of Deadlocks
9.
Chandy-Misra-Haas Algorithm
10.
Unit IV Consensus And Recovery
Consensus And Agreement Algorithms: Problem Definition – Overview Of Results – Agreement
In a Failure-Free System(Synchronous And Asynchronous) – Agreement In Synchronous
TJS/CSE/LP
Systems With Failures; Check pointing And Rollback Recovery: Introduction – Background And
Definitions – Issues in Failure Recovery – Checkpoint-Based Recovery – Coordinated Check
pointing Algorithm – Algorithm For Asynchronous Check pointing And Recovery
Session Teaching Actual
Taken Date Topics To Be Covered
No. Method Date
Consensus And Agreement Bb/Ppt
1. Algorithms: Problem Definition
Overview Of Results Bb/Ppt
2.
Agreement In a Failure-Free Bb/Ppt
System(Synchronous And
3.
Asynchronous)
Bb/Ppt
Agreement In Synchronous Systems
4.
With Failures
Check pointing And Rollback Bb/Ppt
5. Recovery
Introduction – Background And Bb/Ppt
6. Definitions
Issues in Failure Recovery Bb/Ppt
7.
Checkpoint-Based Recovery Bb/Ppt
8.
Coordinated Check pointing Bb/Ppt
9. Algorithm
Algorithm For Asynchronous Check Bb/Ppt
10. pointing And Recovery
Unit V Cloud Computing
TJS/CSE/LP
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
Sessio Actual Topics To Be Covered Teaching Taken
n No. Date Method Date
1. Bb/Ppt
Definition Of Cloud Computing
2. Characteristics Of Cloud- Monitoring – Bb/Ppt
Cloud Services And Platforms:
Application Services
3. Cloud Deployment Models- Compute Bb/Ppt
Services – Storage Services
4. Cloud Service Models Bb/Ppt
5. Driving Factors And Challenges Of Bb/Ppt
Cloud
6. Virtualization – Load Balancing Bb/Ppt
7. Scalability And Elasticity – Replication Bb/Ppt
Staff-In-Charge Hod Principal
TJS/CSE/LP
