DISTRIBUTED AND CLOUD COMPUTING L T P C

23IT405
3 0 0 3

Category Professional Core Courses

Pre requisites Nil

Course Objectives

The course is intended to

1. Introduce the computation and communication models of distributed systems

2. Illustrate the issues of synchronization and collection of information in distributed system
3. Describe distributed mutual exclusion and distributed deadlock detection techniques
4. Elucidate agreement protocols and fault tolerance mechanisms in distributed systems
5. Explain the cloud computing models and the underlying concepts

Course Outcomes

On successful completion of the course, students will be able to

Bloom's
CO. No. Course Outcome
Level

CO1 Explain the foundations of distributed systems. Understand

CO2 Solve synchronization and state consistency problems. Apply

CO3 Use resource sharing techniques in distributed systems. Apply

Implement working model of consensus and reliability of distributed

CO4 Apply
systems.

CO5 Explain the fundamentals of cloud computing. Understand

Course Content

UNIT-I INTRODUCTION 9

Introduction to Cloud Computing – Definition of Cloud – Evolution of Cloud Computing – Underlying

Principles of Parallel and Distributed Computing – Cloud Characteristics – Elasticity in Cloud – On-
demand Provisioning.
UNIT –II CLOUD ENABLING TECHNOLOGIES 9

Service Oriented Architecture – REST and Systems of Systems – Web Services – Publish-
Subscribe Model – Basics of Virtualization – Types of Virtualization – Implementation Levels of
Virtualization – Virtualization Structures – Tools and Mechanisms – Virtualization of CPU – Memory
– I/O Devices –Virtualization Support and Disaster Recovery.

UNIT –III DISTRIBUTED COMPUTATIONS 9

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- IV DISTRIBUTED MUTEX AND DEADLOCK 9

Distributed Mutual Exclusion Algorithms: Introduction – Preliminaries – Lamport’s algorithm – Ricart-

Agrawala’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- V CONSENSUS AND RECOVERY 9

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.

Total : 45 Periods

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”, McGraw Hill
Publishers, 2017.

Reference Books
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,

2010.
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.
Additional / Web References

1. https://onlinecourses.swayam2.ac.in/noc24-cs09
2. https://www.udemy.com/course/distributed-systems-cloud-computing-with-java/

Mapping of Course Outcomes (COs) with Programme Outcomes (POs) Programme Specific
Outcomes (PSOs)

COs POs PSOs

1 2 3 4 5 6 7 8 9 10 11 12 1 2

CO 1 2 2 3 3 2 - - - 2 3 2 2

CO 2 2 3 2 2 2 - - - 2 2 2 3

CO 3 2 2 2 3 3 - - - 2 2 2 2

CO 4 2 2 2 3 2 - - - 3 2 3 2

CO 5 3 3 2 2 2 - - - 3 2 3 2

Average 2 2 2 3 2 - - - 2 2 2 2

3 – High 2 – Medium 1– Low ‘-“ - No Correlation

Continuous
Syllabus Weightage End Semester
Assessment Max. Internal
Duration to be for internal Examination
Components Marks Assessment
covered marks Marks*
Marks
 CIA I 3 Hours 2.5 Units 100 12
24
CIA II 3 Hours 2.5 Units 100 12
Objective Test / Online Quiz, Assignment / Case study, Seminar / 60
Tutorial, Role Play, Poster Presentation, Group Discussions, Oral
16
Presentation, Mini Project etc.,
( marks during CIA I and 8 marks during CIA II)
TOTAL 40 60