w.e.

f:

INDEX
Sl.No Subject Subject Name Page Name of Signature
Code No the faculty
1
2
Distributed C Subathra
3 CS3551
Computing
4
5
6

HEAD OF THE DEPARTMENT

ACOE PRINCIPAL CHAIRMAN

UNITED INSTITUTE OF TECHNOLOGY 1

 CS3551

DISTRIBUTED COMPUTING

UNITED INSTITUTE OF TECHNOLOGY 2

 UNIT I
INTRODUCTION

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

Q.No Question CO BTL Marks

PART A

1. Define distributed system 1 Rem 2

What are the main components of a
2. computer system in a distributed 1 Und 2
environment?
Differentiate between message-passing
3. 1 Und 2
and shared memory systems
What is meant by synchronous and
4. 1 Und 2
asynchronous execution?
What are primitives for distributed
5. 1 Und 2
communication?
6. Define process synchrony 1 Rem 2

What is the significance of the global state

7. 1 Und 2
in a distributed system?
8. Define a distributed program. 1 Rem 2

What are models of communication

9. 1 Und 2
networks in distributed systems?
Why is motivation important in distributed
10. 1 Und 2
computing?
What is the role of middleware in a
11. 1 Und 2
distributed system?
12. List out the features of distributed systems. 1 Rem 2
State the objectives of resource sharing
13. 1 Rem 2
model.
Define the term ‘global state’ in
14. 1 Rem 2
distributed systems.
Define scalability in the context of
15. 1 Rem 2
distributed systems.

UNITED INSTITUTE OF TECHNOLOGY 3

 PART B

Discuss the major design issues and challenges in

1. 1 Und 16
distributed computing with suitable examples.
Compare and contrast message-passing
2. systems and shared memory systems with 1 Ana 16
real time examples.
Explain the significance of synchronous
3. and asynchronous executions in distributed 1 Und 16
systems and their impact on performance.
Describe the various primitives used for
4. distributed communication and explain 1 Und 16
their role in system coordination.
How does the global state affect distributed
5. system performance? Explain with 1 Und 16
examples.
Explain the role of a distributed program in
6. distributed computing. How does it differ 1 Und 16
from centralized computing?
Discuss the different models of
7. communication networks and analyze their 1 Ana 16
impact on distributed systems.
Explain the concept of message-passing in
8. distributed computing and compare its 1 Und 16
advantages and disadvantages.

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; GlobalState and Snapshot Recording Algorithms: Introduction – System Model
and Definitions – Snapshot Algorithms for FIFO Channels.

Q.No Question CO BTL Marks

PART A

1. Define logical time in distributed systems. 2 Rem 2

What is the role of NTP (Network Time
2. Protocol) in physical clock 2 Und 2
synchronization?

UNITED INSTITUTE OF TECHNOLOGY 4

 Differentiate between scalar time and
3. 2 Und 2
vector time
What is meant by message ordering in
4. 2 Und 2
distributed systems?
List the different message ordering
5. 2 Rem 2
paradigms.
6. What is causal order in message passing? 2 Und 2

7. Define total order in group communication. 2 Rem 2

What is the purpose of snapshot recording

8. 2 Und 2
in distributed systems?
Mention any two system models used for
9. 2 Rem 2
global state recording.

10. What is FIFO in snapshot algorithms? 2 Und 2

What is the use of vector timestamps in
11. 2 Und 2
message ordering?
12. What does Lamport’s clock ensure? 2 Und 2
13. State clock skew in distributed system. 2 Rem 2

14. Define snapshot recording. 2 Rem 2

15. When is a global state said to be consistent? 2 Und 2

PART B
Describe the Network Time Protocol
1. (NTP) and explain its role in physical clock 2 Und 16
synchronization.
Compare and contrast different message
2. ordering paradigms in distributed systems 2 Ana 16
with real-time examples.
Explain how asynchronous execution with
3. synchronous communication works and 2 Und 16
discuss its challenges.
Discuss synchronous program order in
4. asynchronous systems and its effect on 2 Und 16
distributed system performance.
Explain the concept of group
5. communication and discuss causal order 2 Und 16
and total order in distributed systems.
Describe snapshot recording algorithms in
6. distributed systems and analyze their 2 Ana 16
significance in global state detection.

UNITED INSTITUTE OF TECHNOLOGY 5

 Explain the system model and definitions
7. related to snapshot recording in distributed 2 Und 16
computing.
Describe FIFO-based snapshot recording
8. 2 Und 16
algorithms with an example.

UNIT III
DISTRIBUTED MUTEX AND DEADLOCK

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.

Q.No Question CO BTL Marks

PART A

Define mutual exclusion in distributed

1. 3 Rem 2
systems.
What is the main idea behind Lamport’s
2. 3 Und 2
mutual exclusion algorithm?
Differentiate between token-based and
3. non token-based mutual exclusion 3 Und 2
algorithms.
What is the significance of Ricart-
4. Agrawala’s algorithm in distributed 3 Und 2
mutual exclusion?
What role does a token play in Suzuki
5. 3 Und 2
Kasami’s broadcast algorithm?
Define deadlock in the context of
6. 3 Rem 2
distributed systems.
What are the two models of deadlocks in
7. 3 Und 2
distributed systems?
List the major steps in the Chandy-Misra-
8. 3 Rem 2
Haas algorithm for deadlock detection.
9. What is fairness in mutual exclusion? 3 Und 2
What is synchronization delay in mutual
10. 3 Und 2
exclusion protocols?
Differentiate between AND and OR
11. 3 Und 2
models

UNITED INSTITUTE OF TECHNOLOGY 6

 What is the difference between centralized
12. 3 Und 2
and distributed deadlock detection
13. What happens after deadlock is detected 3 Und 2
Define cycle detection in the context of
14. 3 Rem 2
deadlocks.
Mention one advantage and one
15. disadvantage of using token-based mutual 3 Rem 2
exclusion algorithms

PART B

Describe Lamport’s mutual exclusion

1. algorithm with a detailed step-by-step 3 Und 16
explanation and example.
Compare and contrast Lamport’s algorithm
2. and Ricart-Agrawala’s algorithm in terms 3 Ana 16
of message complexity and efficiency.
Explain the working of token-based
3. algorithms in distributed mutual exclusion 3 Und 16
and discuss their advantages.
Discuss Suzuki-Kasami’s broadcast
4. algorithm and analyze its efficiency in 3 Und 16
distributed mutual exclusion.
Explain the different models of deadlocks
5. in distributed systems and discuss their 3 Und 16
characteristics.
Describe the Chandy-Misra-Haas
algorithm for detecting deadlocks in
6. 3 Und 16
distributed systems. Compare its working
for the AND model and the OR model.
Discuss the system model for deadlock
7. detection and explain its importance in 3 Und 16
distributed environments.
Compare deadlock detection and deadlock
8. prevention in distributed systems with real 3 Ana 16
world examples.

UNITED INSTITUTE OF TECHNOLOGY 7

 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 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

Q.No Question CO BTL Marks

PART A

1. Define consensus in distributed systems. 4 Rem 2

2. What is agreement in distributed syatems 4 Und 2
List the properties of a consensus
3. 4 Rem 2
algorithm.
4. What is meant by failure-free system 4 Und 2
List any two agreement problems in
5. 4 Rem 2
synchronous systems.
6. Define coordinated checkpointing 4 Rem 2
7. What is rollback recovery? 4 Und 2
8. Define a consistent global checkpoint 4 Rem 2
9. What is meant by orphan message? 4 Und 2
10. Define message logging. 4 Rem 2

11. What is a consistent checkpoint set? 4 Und 2

List two advantages of coordinated

12. 4 Rem 2
checkpointing over uncoordinated.
List the benefits of checkpoint-based
13. 4 Rem 2
recovery in fault-tolerant systems.
What are the key issues in failure recovery
14. 4 Und 2
in distributed systems?
What is the role of rollback recovery in
15. 4 Und 2
distributed fault tolerance?
PART B
Explain the consensus problem in
distributed systems. Why is it challenging
1. 4 Und 16
to achieve consensus in asynchronous
systems?

UNITED INSTITUTE OF TECHNOLOGY 8

 Discuss the synchronous and asynchronous
2. agreement algorithms in a failure-free 4 Und 16
distributed system.
Explain the agreement problem in
3. synchronous systems with failures. How 4 Und 16
does failure impact consensus?
Compare different consensus and
4. agreement algorithms in distributed 4 Ana 16
computing.
What is checkpointing? Explain its role in
5. 4 Und 16
failure recovery with an example.
Discuss the issues in failure recovery and
6. explain how rollback recovery is 4 Und 16
performed in distributed systems.
Compare coordinated and uncoordinated
7. checkpointing. Which one is more efficient 4 Ana 16
in a distributed system?
Describe an algorithm for asynchronous
8. checkpointing and recovery in distributed 4 Und 16
computing.
UNIT V
CLOUD COMPUTING

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

Q.No Question CO BTL Marks

PART A

1. Define cloud computing. 5 Rem 2

List any two characteristics of cloud
2. 5 Rem 2
computing
3. Define virtualization. 5 Rem 2
4. What is elasticity in cloud computing? 5 Und 2
List any two drivers for cloud computing
5. 5 Rem 2
adoption
6. What is replication in cloud? 5 Und 2

UNITED INSTITUTE OF TECHNOLOGY 9

 State two goals of load balancing in cloud
7. 5 Rem 2
systems.
8. What is a virtual machine monitor (VMM)? 5 Und 2

9. List any two examples of IaaS providers. 5 Rem 2

10. List any two cloud storage services 5 Rem 2

Define IaaS, PaaS, and SaaS in cloud
11. 5 Rem 2
computing.
List the different cloud deployment
12. 5 Rem 2
models?
13. List any two cloud compute services. 5 Rem 2

14. What is replication in cloud storage? 5 Und 2

Compare scalability and elasticity in cloud

15. 5 Und 2
computing.

PART B
Compare and contrast different cloud
1. deployment models (Public, Private, 5 Ana 16
Hybrid, and Community).
Discuss the cloud service models (IaaS,
2. 5 Und 16
PaaS, SaaS) with real-world examples.
Explain the major driving factors and
3. 5 Und 16
challenges of cloud computing.
Describe virtualization in cloud computing.
4. 5 Und 16
Discuss its types and advantages.
Explain load balancing in cloud
5. computing. Discuss its role in improving 5 Und 16
performance and fault tolerance.
Compare scalability and elasticity in cloud
6. 5 Ana 16
computing with suitable examples.

Discuss replication in cloud storage and its

7. significance in fault tolerance and high 5 Und 16
availability.
Discuss different cloud services and
platforms, including compute services,
8. 5 Und 16
storage services, and application services
with examples.

----- END ----

UNITED INSTITUTE OF TECHNOLOGY 10

UNITED INSTITUTE OF TECHNOLOGY 11