www.binils.

com
Anna University | Polytechnic | Schools
*X10324* eg. o. :

R
N
Question Paper Code : X10324

B.E./B.Tech. D gr Examina ionS, P L/ Y 2021

e
ee
t
A
RI
MA
Sixth Semester
Computer Science and Engineering
8603 – i ri u m
cs
d
st
b
ted
syste
s
( egulations 2017) R
Time : Three Hours aximum : 100 arks
M
M
nswer a questions
A
ll
Par – (10×2=20 Marks)
t
A
1. Why do we need a distributed system ?
2. List out the distributed system challenges.
3. ame the various message ordering paradigms used in distributed systems.
N
4. Define causal order execution.
5. What are the different models of deadlocks ?
6. What is the purpose of the wait-for-graph (WF ) ? ive an example for WF .
G
G
G
7. What do you mean by local checkpoints ?
8. What is the drawback of a checkpoint based rollback recovery approach ?
9. List out the characteristics of P2P systems.
10. What is the difference between shared memory and distributed memory ?

Par – B (5×13=65 Marks)

t
11. a) i) How do you classify a parallel system and brief them ? (8)
ii) Compare Synchronous versus asynchronous execution. (5)
( )
OR
b) What are the functions must be addressed while designing and building a
distributed system ? Explain.
 www.binils.com
Anna University | Polytechnic | Schools
X10324 *X10324*

12. a) I
llustrate the necessary and sufficient conditions for causal ordering.
( )

OR
b) Discuss in detail about Snapshot algorithms for F F channels.

I
O
13. a) Discuss in detail the requirements that mutual exclusion algorithms should
satisfy and discuss what metric we use to measure the performance of mutual
exclusion algorithms.
( )
OR
b) List out the four classes of distributed deadlock detection algorithms and
explain any two of them.

14. a) What are the key assumptions underlying while designing agreement
algorithms and brief them ?
( )
OR
b) Describe the issues involved in a failure recovery with the help of a distributed
computation.

15. a) What do you understand about Content- ddressable etworks (C )?

A
N
AN
Explain how it is useful in P2P networks.
( )
OR
b) Describe in detail about Distributed Shared emory (DS ) and its application.
M
M
Par – C (1×15=15 Marks)
t
16. a) What are the significant factors affecting the interacting processes in a
distributed systems ? ow the interaction model deals with the difficulty of
h
setting time limits in a distributed system ? Explain.
( )
OR
b) External synchronization ensures internal synchronization. But the vice
versa does not stand true. Justify. Explain Lamport’s algorithm in brief.

__________________