.

l
Paper ir ta
I
11 ./

pjr ( Co ^-D) 1 CP)YI

.,\ l-
l-/ I

(Time:3

N.B: 1) Question number I is compulsory.

2) Attempt any THREE out of the remaining.
3) Assurne suitable data if necessary and justi$r the assumptions
4) Figures to the right indicate full marks.

Q1
A Explain key Features of Global Scheduling algorithm.
B \\Ihat are the services offered by uriddleware? l0sl
C Differentiate between RMI and RPC. l0sl
D Explain syrcl.rronization irr DFS u,itli its challenges. l0sI
L
Q2
A [1 0l
B [1 0l

a
A Explain group t10I
B Explain Ravmond tree based algorithm fol rnutual [10]

a4
A Explain and horv ir mess age l10l
overhead 1n achieving mutual
B Discuss Google fil system ( GFS) AS 1e distributed file system. [10]

(_ A Explain bully election algorithm. [10]

B Discuss code migration in distributed system. I10l

a6
A Explain any data centric consistency models. t10l
B Discuss design issues in distributed systems. t10I

*rktl.)k*****

64784 Page 1 of 1

x822YDF43 0CX822YDF43 0CX822yDF43 0CX822yDF43 0C

qu
 31
9A

31
9A
32
Paper / Subject Code: 52771 / Distributed Computing

X5

X5
74

1Y

74
9A
32

9A
32
3

3
X5
1Y

X5
74

1Y

74
9A
32
53

9A
32
3
X5
1Y
AX

74

1Y

74
9A
32
53

32
3
49

X5
1Y
AX

74

1Y
27

9A
Duration: 3Hrs [Max Marks: 80]

32
53
Y3

3
49

3
X5
1Y
AX

74

1Y
27
31

9A
32
53
N.B.: (1) Attempt any four questions

Y3

3
X5

49

X5
1Y
AX

74
27
(2) All questions carry equal marks

31
9A

9A
32
53
Y3
X5

49
(3) Assume suitable data, if required and state it clearly

74

1Y
AX

74
27
31
9A
32

32
3
Y3
X5

49
1Y

X5

9
74

1Y

74
27
31
9A
32
53

9A
Q1 A Explain any five data centric consistency models with example data stores. [10]

32
3
Y3
X5
1Y

X5
AX

74

74

1Y
B Explain different load estimation policies and process transfer policies used in load [10]

31
9A
32
53

9A
32
balancing approach of distributed system.
49

3
X5
1Y

X5
AX

74

1Y

74
27

9A
32
53

9A
32
Y3

53
49

1Y

X5
AX

74

1Y
AX

74
27
31

Q2 A What is Remote Procedure Call? Describe the working of RPC in detail. [10]

32
53

9A
32
Y3

53
X5

49

B Explain Bully election algorithm. [10]

49
1Y
AX

1Y
AX

74
27
31
9A

27
53

32
Y3

53
X5

49

Y3

49
74

AX

1Y
AX
27
31
9A

27
32

31
Q3 A Discuss design and implementation issues of distributed shared memory. [10]
Y3

53
X5

49

Y3
1Y

X5

49
74

B What are desirable features of a good DFS? [10]

AX
27
31
9A

27
32

31
53

9A
Y3
X5

Y3
1Y

X5

49
AX

74

74
31
9A

27
32

31
53

9A
32

Q4 A Discuss various issues and goals related to design of distributed system. [10]
49

X5

Y3
1Y

X5
AX

74

1Y

B What is distributed mutual exclusion? Explain how Suzuki-Kasami’s broadcast [10]

74
27

9A
32

31
53

9A
32
Y3

53
49

algorithm achieves distributed mutual exclusion.

1Y

X5
AX

74

1Y
AX

74
27
31

32
53

9A
32
Y3

53
X5

49

49
1Y
AX

1Y
AX

74
27
31
9A

27

Q5 A What is need of code migration? Explain the role of process to resource and [10]
53

32
Y3

53
X5

49

Y3

49
74

resource to machine binding in code migration.

AX

1Y
AX
27
31
9A

27
32

31

B Explain various file caching schemes. [10]

Y3

53
X5

49

Y3
X5

49
4
27

AX
27
31
A

27
31
9A
Y3

49

Y3
X5

Y3
X5

49
74

Q6 A What is physical clock? Explain any one physical clock synchronization method. [10]
27
31

31
A

27
31
9A
32

B What is fault tolerance? Describe different types of failure models. [10]

Y3
X5

49

X5

Y3
X5
1Y

74
27
31
9A

31
9A
32
53
Y3
X5

49

X5
1Y
X

74
27
31
9A

9A

9A
32

*************
53
Y3
X5
74

74

1Y
X

74
31
9A
32

9A
32

32
53
X5
1Y

74

1Y

74

1Y
X
9A
32
53

9A
32
53

53
1Y

74

1Y
AX

74

X
32
3

9A
32
53
X5

49
1Y

1Y
AX

74
27
9A

32
53
Y3
X5

49
74

1Y
AX
27
31
9A
2
Y3

53
Y3
5

49
74

AX

AX
27
31
32

49

Y3
5

49
1Y

AX
27

27
31
53

54451
3

49

Y3
5
1Y
AX

AX
27

31
3
49

3
X5

49

X5
1Y

27
9A

9A
3

Y3
X5

X531Y32749AX531Y32749AX531Y32749AX531Y32749A
74

74
 D
8

30
A9
BD

95

23
Paper / Subject Code: 52771 / Distributed Computing

FB
F7

D3
86
35

A9
BD

95

23
9C

3
FB
F7

D3
86
35
4F
Time:(3 Hours) marks:80

A9
BD

95

23
9C
7
C0

F7

3
86
35
4F

D
N.B: 1) Question number 1 is compulsory.

A0

BD

95

23
9C
7
C0

F7
99

6
35
4F
2) Attempt any three out of the remaining.

8
A0

BD
03

95

23
9C
7
C0
3

F7
99

6
3) Assume suitable data if necessary and justify the assumptions.

35
4F
FB

8
A0

BD
03

95
9C
7
A9

C0
4) Figures to the right indicate full marks.

F7
99

35
4F
FB
D3

A0

BD
03

9C
7
A9

C0
23

99

35
4F
FB
Q1

D3
86

A0

BD
03

9C
7
A9
95
A Explain how Monotonic read consistency model is different than Read your Write [5]

C0
23

99

35
4F
FB
F7

D3
86

A0
03
consistency model

9C
7
A9
BD

95

C0
23

99

4F
B What is 1:M and M:1 group communication? [5]

FB
F7

D3
86

A0
35

03

7
A9
BD

95

C0
23
9C

99
C Differentiate between NOS DOS and Middleware in the design of distributed systems [5]

FB
F7

D3
86

A0
35

03
4F

7
A9
BD

95
D What is fault tolerance? Explain failure models. [5]

C0
23
9C

3
07

99
FB
F7

D3
86

A0
C

35

03
4F

A9
A0

BD

95

23
9C

3
07

99
FB
F7

D3
99

86
C

35

03
4F

Q2

A9
A0

BD
03

95

23
9C

3
07

FB
A Explain code migration and its techniques. [10]
B3

F7

D3
99

86
C

35
4F

A9
A0

BD
03
F

95
B Explain Bully election algorithm with suitable example. [10]

23
9C
07
A9

B3

F7

D3
99

86
C

35
4F
D3

A0

BD
03
F

95

23
9C
07
A9

Q3
23

B3

F7
99

86
C

35
4F
D3
86

A Explain Raymond’s algorithm for mutual exclusion.

A0

BD
03
F

95
9C [10]
07
A9
95

23

B3

F7
99

35
4F
B What are different data centric consistency models [10]
F7

D3
86

A0

BD
03
F

9C
07
A9
BD

95

23

B3

99

35
4F
F7

D3
86

A0
35

03
F

Q4

9C
07
A9
BD

95

23
9C

B3

99

0C

A Explain different load estimation and process transfer policies used by load balancing [10] 4F
7

D3
86
35

03
4F

F
DF

07
9A
A9

algorithms.
95

23
9C

B3
07

C
5B

39
F7

D3
86

A0

B What are physical clocks? Explain any one physical clock synchronization algorithm. [10]
0C

4F

F
C3

30
A9
BD

95

23
07

99
A

FB
F9

F7

D3
99

86
0C

35

3
30
74

A9
BD
03

95

23
9C
9A

FB

Q5
C0

F7

D3
86
35
4F
39

A9
A0

BD

95

23

A What are different issues and goals related to distributed systems? [10]
9C
07
30

F7

D3
99

86
0C

5
4F
FB

B Explain file caching schemes [10]

C3

BD
03

95

23
07
A
A9

F9
B3

F7
99

86
0C

5
D3

C3
74

BD
03
9F

95
A

Q6
C0

F9
B3

F7
3A

99

5
C3
74

A Write a short note on Replication and the types of it. [10]

A0

BD
03
9F
3D

C0

F9
B3
3A

99

B What is RPC? Explain working of RPC in detail [10]

5
2

C3
86

74
A0
03
9F
3D

___________________
95

C0

F9
B3
3A

99
62
F7

74
A0
03
9F
3D
58

C0
B3
3A

99
79

62

A0
03
9F
DF

3D
58

B3
3A

99
79

2
5B

86

03
9F
DF

3D
C3

95

B3
3A
2
5B
F9

F7

86

9F
3D
C3

BD

95

3A
2
F9

F7

86
35

3D
74

BD

95
9C

2
C0

F7

86
35
4F
A0

BD

95
9C
07

38785 Page 1 of 1
F7
99

0C

35
4F

BD
9C
07
9A

0C

35
4F

399A0C074F9C35BDF7958623D3A9FB30
39
 A0

F4
8B
EF

E
Paper / Subject Code: 52771 / Distributed Computing

E9

DA
44
08
4C

A0
8B
EF
A7

9E

F
DA
44
08
4C

0E
FB

8B
EF
A7

9E
A
86

44
8
C

0E
FB
8D

0
4

8B
F
A7

4A
86

E
AB

08
4C
Duration: 3hrs [Max Marks:80]

B
D

B4
94

EF
8

A7

A
86

88
B
43

44
C
A

FB
D

F0
N.B. : (1) Question No 1 is Compulsory.

4
AF

8B
B8

A7
9

86

E
43
ED
(2) Attempt any three questions out of the remaining five.

8
4C
A

B
D

F0
AF

F
B8

7
E9
(3) All questions carry equal marks.

E
BA
43

8
D

C
A
A0

D
(4) Assume suitable data, if required and state it clearly.

4
F

F
B8

7
E9

DA

39
44

86

E
A

4C
A
A0

FB
8B

D
9E

AF

B8

A7
1 Attempt any FOUR [20]

39
4
08

6
0E
4

D8
D

4A
4

FB
8B
EF
a Explain issues in designing Distributed system

E
4A

AF

8
9

39
8

86
4C

AB
0E
b Compare NOS and DOS

4
0

ED

F4
B
EF

8D
A7

4
88
c Explain desirable features of global scheduling algorithm

E9

DA

39
4

6
C

AB
FB

4
0

D8
4

A0

4
8B
d Explain the need of election algorithm. EF
A7

AF

94
86

B8
E9
44
8
4C

e Justify how Ricart-Agrawala’s algorithm optimized the Message overhead in

B

43
8D

F0

ED

4A
0
8B
F

4A

AF
86

E
AB

achieving mutual exclusion

E9

39
08
C
B
8D

B4

D
4

A0

F4
94

F
7

E
86

8
AB

E9
3

DA
44
08
4C
2 a What is Remote procedure call? Explain how transparency is achieved in RPC [10]
F4

B
D

0
94

B
6F

F
8

9E
DA

4A
CE

88
B

b Explain various forms of message oriented communication with suitable [10]

A
3

8
A

0E
F4

FB
D

B4
F0
9E

4
4

example
B8

7
DA

4A
39

86

CE

8
BA
0E

08
A
F4

B4
9E

74
4A

EF
8
DA

39

3 a What is logical clock? Why are logical clocks required in distributed systems? [10]

88
AB

BA
0E
B4

4C
F4

F0
9E
4A

How Lamport does synchronizes logical clock? Which events are said to be
4

6F
88

B8

A7
A

39

CE
0E
B4
F0

D8
ED

concurrent in Lamports timestamp

4A
4

FB

74
4A

AF
CE

88

8
9

39

b Explain Chandy -Misra_Hass Algorithm for distributed deadlock detection. [10]

86
B

BA
0E
B4
F0

D
74

4A
F4

8D
E
4A
CE

6F
88
A

E9

DA

39

AB
FB

B4
F0

D8

4 a Explain different load estimation and process transfer policies used by load [10]
74

A0

4
E

AF

94
6

CE

88
A

B8
E9

balancing algorithms.
D8

44
FB

43
F0

ED
74

4A
0
B
B8

b Describe code migration issues in details [10]

4A

AF
86

CE

88
A

39
E
FB
8D

B4
F0

ED
74

A0

F4
86

CE

8
B

E9

5 a Discuss and differentiate various client consistency models. [10]

DA
44
08
4A

FB
8D

74

0
B
F

b Explain Absolute ordering and Casual ordering process with the help of example [10]
9E
4A
39

86

88
AB

0E
F4

FB
8D

for many to many communication.

4
F0
74
94

8B
DA

4A
86

CE
AB

BA
43

08
8D

B4
74
AF

94

EF

6 a List desirable features of distributed File system. How are modifications [10]
86

88
AB

BA
43
ED

4C

propagated in file caching schemes?

8D

F0
AF

94

6F

A7
E9

CE
AB

b Discuss Raymonds tree based algorithm of token based in distributed mutual [10]
43

8
ED
A0

FB
D

74
AF

94

exclusion
8
E9
44

86
AB

BA
43
ED
A0

8D
AF

94

6F
E9
4

AB

*********
43
B4

D8
ED
A0

AF

94
8

B8
E9
4
08

43
B4

ED

4A
A0
EF

AF
8

E9

39
4
08
4C

B4

ED
A0

F4
EF

E9

DA
4
08
4C

B4

A0
EF
A7

9E
8

4
08
4C

0E
B

B4

27234 Page 1 of 1
6F

EF
A7

4A
8
D8

08
4C
FB

B4
F
A7
86

CE

88
FB

AB8D86FBA74CEF088B44A0E9EDAF4394
8D

F0
74