Doc No CF - CP
Rev. No. 00
Date
Page No. 1 of 13
COURSE PLAN – THEORY
Faculty Name [Link]
Designation / Department Assistant Professor/ Artificial Intelligence and Data Science
Course Code /Name CS3551 / Distributed Computing
Programme / Branch [Link] Artificial Intelligence and Data Science
Year /Semester III/ V
Academic Year 2025– 2026
Regulation 2021
Core/ Elective Core
Contact Hours 45
No. of Credits 3
Course Pre-requisites:
a. Operating Systems
b. Computer Networks
Course Learning Objective:
a. To understand the foundations of distributed systems
b. To learn issues related to clock synchronization and the need for global state in
distributed systems.
c. To learn distributed mutual exclusion and deadlock detection algorithms.
d. To understand the significance of agreement, fault tolerance and recovery protocols in
distributed systems.
e. To learn the characteristics of peer-to-peer and distributed shared memory systems.
1. At the end of the course, the student will be able to:
Doc No CF - CP
Rev. No. 00
Date
Page No. 2 of 13
Knowledge
Course Outcomes
Level
To introduce the computation and communication models of
CO1 U
distributed systems
To illustrate the issues of synchronization and collection of
CO2 U
information in distributed systems
To describe distributed mutual exclusion and distributed deadlock
CO3 U
detection techniques
To elucidate agreement protocols and fault tolerance mechanisms
CO4 An
in distributed systems
To explain the cloud computing models and the underlying
CO5 An
concepts
Cognitive Domain:
R- Remember; U- Understand; Ap-Apply; An- Analyze; E- Evaluate; C-Create
2. Programme Outcomes:
Students graduating from Artificial Intelligence and Data Science should be able to:
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals and an engineering specialization to the solution of complex engineering
problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze
complexengineeringproblemsreachingsubstantiatedconclusionsusingfirstprinciplesofmathema
tics, naturalsciences, and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex engineering problems
and design system components or processes that meet the specified needs with appropriate
Doc No CF - CP
Rev. No. 00
Date
Page No. 3 of 13
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
PO4 Conduct investigations of complex problems :Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of data, and
synthesis of the information to provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent responsibilities
relevant to the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the knowledge
of, and need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and
write effective reports and design documentation, make effective presentations, and give and
receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.
PO12 Life-longlearning: Recognize the need for, and have the preparation and ability to
Doc No CF - CP
Rev. No. 00
Date
Page No. 4 of 13
engage in independent and life-long learning in the broadest context of technological change.
Programme Specific Outcomes:
Students graduating from Artificial Intelligence and Data Science should be able
to:
PSO1
To analyze, design and develop computing solutions by applying foundational concepts
of Artificial Intelligence and Data Science
PSO2
To apply software engineering principles and practices for developing quality software
for scientific and business applications.
PSO3
To adapt to emerging Information and Communication Technologies (ICT) to innovate
ideas and solutions to existing/novel problems.
3. CO-PO Mapping Table:
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO 1 2 1 - - - - - - - - - - 2 - -
CO 2 2 1 - - - - - - - - - - 3 - -
CO 3 3 2 1 1 - - - - - - - - 3 2 2
CO 4 3 2 1 1 - - - - - - - - 3 2 2
CO 5 3 2 - - - - - - - - - - 3 2 2
Weighted
2.6 1.6 0.4 0.4 - - - - - - - - 2.8 1.2 1.2
Average
Level of Correlation 3 - Strong 2- Moderate 1 -Weak
Doc No CF - CP
Rev. No. 00
Date
Page No. 5 of 13
4. Course Syllabus:
CS3551- DISTRIBUTED COMPUTING
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.
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
UNIT III 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.
UNIT IV CONSENSUS AND RECOVERY
Consensus and Agreement Algorithms: Problem Definition – Overview of Results –
Agreement in aFailure-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
Doc No CF - CP
Rev. No. 00
Date
Page No. 6 of 13
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: ComputeServices – Storage Services – Application Services
TOTAL: 45 PERIODS
REFERENCES:
5. Course Plan: LTPC 3003
Text
Lecturer Cumulative Teaching Focus for CO
Topic to be covered Book/
Hours hours methodology achievement
Reference
UNIT I – INTRODUCTION
Introduction: Definition –
L1. Relation to computer system 1 T1 CB CO 1
components
Motivation –Relation to
parallel systems – Message-
L2. passing systems versus shared 2 T1 CB CO 1
memory systems
Primitives for distributed
communication –Synchronous
L3. versus asynchronous 3 T1 CB CO 1
executions
L4. Design issues and challenges 4 T1 CB CO 1
A model of distributed
L5. computations: A distributed 5 T1 CB CO 1
program
A model of distributed
L6. executions –Models of 6 T1 CB CO 1
communication networks
L7. Global state – Cuts –Past and 7 T1 CB CO 1
future cones of an event –
Models of process
Doc No CF - CP
Rev. No. 00
Date
Page No. 7 of 13
communications
Logical Time: A framework
L8. for a system of logical clocks 8 T1 CB CO 1
–Scalar time
Vector time – Physical clock
L9. synchronization: NTP 9 T1 CB CO 1
Learning Outcomes:
On learning this unit, the student should be able to:
Know the fundamentals of Distributed system.
Understand the concept of message passing.
Define the Distributed Computations.
UNIT II – LOGICAL TIME AND GLOBAL STATE
Message ordering and group
L10. communication 10 T1 CB CO 2
Message ordering paradigms – CO 2
L11. Asynchronous execution with 11 T1 CB
synchronous communication
Synchronous program order CO 2
L12. on an asynchronous system 12 T1 CB
Group communication – CO 2
L13. Causal order (CO) 13 T1 CB
L14. Total order 14 T1 CB CO 2
Global state and snapshot CO 2
L15. recording algorithms 15 T1 CB
L16. Introduction 16 T1 CB CO 2
L17. System model and definitions 17 T1 CB CO 2
Snapshot algorithms for FIFO CO 2
L18. channels 18 T1 CB
Learning Outcomes:
On learning this unit, the student should be able to:
Understand the concept of message ordering
Doc No CF - CP
Rev. No. 00
Date
Page No. 8 of 13
Define Casual order
Gain the knowledge about Snapshot
UNIT III - DISTRIBUTED MUTEX & DEADLOCK
Distributed mutual exclusion
L19. algorithms: Introduction 19 T1 CB CO 3
Preliminaries – Lamport‘s
L20. algorithm 20 T1 CB CO 3
Ricart-Agrawala algorithm –
L21. Maekawa‘s algorithm 21 T1 CB CO 3
Suzuki–Kasami‘s broadcast
L22. algorithm 22 T1 CB CO 3
Deadlock detection in
L23. distributed systems: 23 T1 CB CO 3
Introduction
L24. System model – Preliminaries 24 T1 CB CO 3
Models of deadlocks –
L25. Knapp‘s classification 25 T1 CB CO 3
Algorithms for the single
L26. resource model 26 T1 CB CO 3
the AND model and the OR
L27. model 27 T1 CB CO 3
Learning Outcomes:
On learning this unit, the student should be able to:
Understand the concept of mutual algorithm.
Gain knowledge about Deadlock.
Define Distributed Mutex.
UNIT IV - CONSENSUS & Recovery
Checkpointing and rollback
L28. 28 T1 CB CO 4
recovery: Introduction
Background and definitions –
L29. Issues in failure recovery 29 T1 CB CO 4
Doc No CF - CP
Rev. No. 00
Date
Page No. 9 of 13
Checkpoint-based recovery –
L30. Log-based rollback recovery 30 T1 CB CO 4
Coordinated checkpointing T1 CB
L31. 31 CO 4
algorithm
Algorithm for asynchronous
L32. checkpointing and recovery 32 T2 CB CO 4
Consensus and agreement
L33. algorithms: Problem definition 33 T2 CB CO 4
L34. Overview of results 34 T2 CB CO 4
L35. Agreement in a failure 35 T2 CB CO 4
free system – Agreement in
L36. synchronous systems with 36 T2 CB CO 4
failures
Stream oriented
L37. Content beyond the syllabus
Communication
Learning Outcomes:
On learning this unit, the student should be able to:
Understand the concept of failure recovery.
Known about consensus.
UNIT V – CLOUD COMPUTING
Peer-to-peer computing and
L38. 37 T1 CB CO 5
overlay graphs: Introduction
L39. Data indexing and overlays 38 T1 CB CO 5
L40. 39 T1 CB CO 5
Chord
– Content addressable
L41. 40 T1 CB CO 5
networks
L42. 41 T2 CB CO 5
Tapestry
L43. Distributed shared memory 42 T1 CB CO 5
Doc No CF - CP
Rev. No. 00
Date
Page No. 10 of 13
L44. Abstraction and advantages 43 T1 CB CO 5
L45. Memory consistency models 44 T1 CB CO 5
Shared memory Mutual
L46. 45 T1 CB CO 5
Exclusion
Learning Outcomes:
On learning this unit, the student should be able to:
Understand the concept of Distributed System
Known about P2P
Gain knowledge about Distributed Shared memory
6. Text Books/References/ Websites:
Text/Ref/Website Details
Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing:
T1
principles, algorithms, and systems. Cambridge University Press, 2011
George Coulouris, Jean Dollimore and Tim Kindberg, ―Distributed
T2
Systems Concepts and Design‖, Fifth Edition, Pearson Education, 2012
Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”,
R1
Prentice Hall of India, 2007
Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in
R2
operating systems. McGraw-Hill, Inc., 1994
Tanenbaum A.S., Van Steen M., ―Distributed Systems: Principles and
R3
Paradigms‖, Pearson Education, 2007
Liu M.L., ―Distributed Computing, Principles and Applications‖, Pearson
R4
Education, 2004
Nancy A Lynch, ―Distributed Algorithms‖, Morgan Kaufman Publishers,
R5
USA, 2003.
NPTEL [Link]
7. Content Beyond Syllabus:
Doc No CF - CP
Rev. No. 00
Date
Page No. 11 of 13
Mode of Resource Coverage of
[Link]. Topic
Implementation Person POs /PSOs
PO1,PO2,
1 PO3, PO5 &
PSO1
8. Assignment:
Coverage of
CO’s with RBT
Assignmen Assignment Topics Submission
Levels
t No. (Each Quest Carries 5 Marks) Date
(AP/AN Level
Only)
Illustrate physical clock synchronization with
example. CO 1, AP
1
Differentiate message passing and shared
CO 1, AN
memory and how they emulate.
Illustrate the snapshot algorithm for FIFO
Channels. CO 2, AP
2
Illustrate the optimal KS Algorithm for CO
CO 2, AP
How to detect deadlock in distributed system
CO 3, AN
and explain the system model.
3
Illustrate the Lamport’s algorithm.
C0 3, AP
Demonstrate in detail about the juang-
venkatesan algorithm for asynchronous check CO 4, AN
pointing and recovery.
4
Analyze on phase-king algorithm for
consensus. CO 4, AN
Illustrate in detail about a scalable object
CO 5, AP
location algorithm in chord.
5
Analyze how to implement sequential
CO 5, AN
consistency in distributed system.
Doc No CF - CP
Rev. No. 00
Date
Page No. 12 of 13
9. Student’s Class Notes Verification Schedule:
[Link]. Portions Verification date
1 Upto 2.5 units Before the commencement of CIA – I
2 Unit-2.5 TO 5.00 Before the commencement of CIA – II
10. Internal Examination Schedule:
[Link]. Examination Date Topic Marks
1 CIA– I As per Anna University Upto 2.5 Units 100
Chennai Schedule
2 CIA– II As per Anna University Unit2.5 to Unit5 100
Chennai Schedule
CIA-Continuous Internal Assessment
11. Course Outcome (CO) Assessment:
Direct Outcome (80%) Indirect Outcome (20%)
CIA– I
CIA– II
60% of Direct Outcome Course End Survey
Assignment
AU End Semester Examination 40% of Direct Outcome
CIA - Continuous Internal Assessment MCQ – Multiple Choice Questions
12. End Semester Evaluation Components (Anna University, Chennai):
Doc No CF - CP
Rev. No. 00
Date
Page No. 13 of 13
Marks
Sl. No. Components
Internal External
1 Internal Examinations (I – III) 40
2 University Examination 60
Total 100
Date of preparation:
Course Coordinator HoD–AI&DS
[Link]