25

88

5
8

52
68
Y2
Paper / Subject Code: 37476 / Distributed Computing (DLOC II)

X5
96

8X
A9
2A

25
88
May 29, 2024 02:30 pm - 05:30 pm 1T01876 - T.E. Computer Science and Engineering (Artificial

52
68
Y2
X5
96
5Y
Intelligence and Machine Learning) (Choice Based) (R-19- ’C’ Scheme)SEMESTER - VI / 37476 - Distributed

8X
A9
2A

25
88
52
Computing (DLOC II) QP CODE: 10056836

8
Y2
X5
6
5Y

6
8X

A9
A

25
8
52
68

8
2

Y2
Time: 3 hours Total Marks: 80

5
6
5Y
X
A9

8X
A9
88

25
52
Y2

8
2

2
6

5
6
5Y
X

Y
9

X
9
25

2A

25
88
52
68
Y2
X5
N.B. 1. Question No. 1 is compulsory

5
96
5Y
8X
9

X
5
88

A
2. Attempt any three questions from remaining five questions

2A

88
2

2
8
2
X5
96

5
6
Y

96
3. Assume suitable data if necessary and justify the assumptions

5Y
8X
9
2A

25
8

2A
8
4. Figures to the right indicate full marks

2
8
Y2

8
X5
6

5
5Y

6
Y
A9

X
9

A9
5
8

2A

25
88
52

52
8
2

Y2
96
Q1 Answer the following questions.

X5
5Y

6
8X

Y
X

A9
2A

25
8

25
88
52
68

8
A Identify and explain five issues in distributed systems. 05

2
5
96

X5
5Y

6
X

Y
A9

A9
B Analyze how Ricart-Agrawala’s algorithm optimizes the message overhead in
8

2A

25
05

8
2
8
Y2

68
5

2
6

5
96

5
Y
8X
achieving mutual exclusion.

5Y
A9

8X
25

A9
5

2A

8
2
8

52
Y2

C Describe the desirable features of a global scheduling algorithm. 05

68
X5

68
X5

Y2
6

Y
9

8X
A9
25

A9
88

D Compare processes and threads. 05

A

5
8

5
2
8

52
Y2

8
X5

Y2
96

X5

Y2
6

6
A9

8X
A9
2A

25
88

25
88

25
Q2 A Explain the message communication model in distributed systems, covering transient 10
2

68
X5

Y2
96

X5
5Y

X5
Y

synchronous, transient asynchronous, persistent synchronous, and persistent

9
2A

25
88

2A

5
88
52

2A

88
52
5

asynchronous communications.
96
5Y

96
8X

5Y

96
X

Y
X
2A

25
B Describe the working of Remote Procedure Call (RPC) in detail, with the help of a 10 88
52

2A
68

2
8

Y2
5
96

5
5Y

96
8X
A9

8X

diagram.

5Y
X
A

88
52
68

52
Y2

52
2

Y2
6
5Y

96
8X
A9

X
A9

8X
25

Q3 A Explain the Suzuki-Kasami Broadcast Algorithm for mutual exclusion. 10

5
8

A
52
68

2
Y2

8
X5

68
Y2
X5
6
Y
8X
A9

B Analyze the architecture and performance of the Andrew File System (AFS) 10
A9
25

A9
88

25

25
88
68
Y2
X5

2
96

compared to the Network File System (NFS). Discuss the advantages and
X5

Y2
X5
96
Y
A9
2A

25
88

25
88

limitations of each.
2A

25
88
Y2
X5
6

5
6

X5
96
5Y
A9

X
A9
5
88

88

88
52

2
Y2

Q4 A Compare load sharing, task assignment, and load balancing strategies for 10
Y2

Y2
96

5
6

96
X

8X
9
5

scheduling processes in a distributed system.

A

25
88

25
52

2A
Y2

8
Y2
X5
6

X5

B Explain the Bully Election algorithm with the help of an example. 10

6
8X

5Y
A9

A9
25

25
88

8
68

52
Y2

68
X5

2
5
96

Y
X

8X
A9
5
8

5
88
52
68

Q5 A Discuss different data-centric consistency models in detail. 10

52
Y2

68
Y2
6
8X
A9

B Explain Maekawa’s algorithm for mutual exclusion and specify the properties of
A9

10
A9
25

25
88
8
2

Y2
X5

Y2
96

the Quorum Set.

X5
5Y

96
A

5
8

25
88
52

52
68
Y2

Y2

X5
6
8X

Q6 A Describe code migration in distributed systems. 10

A9

9
25

2A

88
52
8
2

B Explain the features of Distributed File Systems (DFS) and draw and explain the 10
5

96
5Y

96
8X

Y
8X

model file service architecture.

A

25

2A
2
68

8
Y2
X5

X5
96

5Y
A9

25
88

88

_____________________________
52
Y2

Y2
5
96

96
8X

8X
2A

25

A
68

68
Y2
5
5Y

8X
A9

A9
25
52

68
Y2

Y2
5
8X

56836 Page 1 of 1
8X
A9
25

25
68

68
Y2
X5

X5
A9
25
88

88
Y2
X5
96

X525Y2A9688X525Y2A9688X525Y2A9688X525Y2A9688
96