www.jntuworld.

com

Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

www.android.jntuworld.com

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6

Q6

www.jwjobs.net

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Code No o: C6202 JAWA AHARLAL L NEHRU TECHNOLO T OGICAL UN NIVERSITY HYDERA ABAD M.Tech I SEMESTE ER EXAMI INATIONS S, APRIL/M MAY-2013 DI ISTRIBUTE ED SYSTEM MS (W WEB TECH HNOLOGIE ES) Time: 3hours Max.Mar rks:60 A Answer any five f questio ons All questions q ca arry equal marks m ---

R09Q6 Q6 R

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

1.a) b)

What is transp W parency? Di istinguish be etween acces ss and locatio on transpare encies. A Client send ds 200 byte request mes ssage to a se ervice which h produces a response of 5000 byte es. Estimate the total ti ime to comp plete the re equest in each of the fo ollowing cas ses, with performance as ssumptions li isted below: i) ) Using con nnectionless (datagram) communicat c tion ii i) Using con nnection orie ented commu unication ii ii) The serve er process is in the same machine as the client. (L Latency / pa acket (remot te or local) to send or receive: 5 ms; m Connect tion setup ti ime: 5 ms; Data transf fer rate: 10 0 Mbps; MT TU: 1000 bytes; b serve er request pr rocessing tim me: 2 ms; as ssume that th he network lo oad is low).

2.a) b) c) 3.

Q6 Q6

List 3 problem L ms encount tered on usin ng alias for naming n serv vice. How ca an they be ov vercome? W What is name e resolution? ? Describe the t methods of name res solution with h suitable diagrams. D Distinguish between b syste em oriented names and human h orien nted names.

Q6 Q6 Q6 Q6

What are the W e design issu ues in a Dis stributed file e system? Explain E in detail d how th hese issues are a handled in i Sun NFS with w an expl lanation of it ts architectur re. What are logical clocks? Describe in W n detail any one o approac ch for implem mentation of logical clocks with exa ample. C Consider the e following g space tim me-diagram showing the t differen nt events (e eij where i is s processor number n and j is event in n the processor) happening in the sy ystem in var rious process sors (p)

4.a) b)

T N

W U

R O

D L

Q6 Q6 Q6

www.jntuworld.com

www.jntuworld.com

Q6 Q6 Q6 Q6 Q6 Q6

Q6

Q6

www.android.jntuworld.com

Q6

Q6

Q6

Q6

www.jwjobs.net

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Show their ordering using logical clocks and vector clocks. Explain the messages. Q6 Q6 extend Q6 Q6 logicalQ6 Q6 How do vector-clocks the notion of Lamports clocks? 5.a) b) What is a transaction? Explain nested transactions. With reference to nested transactions answer the following with suitable explanations: i) Can a transaction commit / abort independent of other transactions in the family? ii) What happens when a transaction in a family fails? iii) When to changes made to data items in a transaction become visible to other transactions in the family? Discuss in detail any two methods for handling concurrent transactions with illustrations.

Q6
c)

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6 Q6 Q6 Q6 Q6 Q6

Q6 Q6 Q6

6.a) b)

Describe in detail probe based approach for deadlock detection. A system has three types of resources R1, R2, R3 with 4,2,2 units each. R1 and R2 are in site S1 and R3 is in site S2. Processes P1,P2,P3 and P4 are competing for resources as follows: P1 holding 2 units of R1 and is requesting 1 unit of R2. P2 holding 2 units of R2 and is requesting 1 unit of each R1 and R3. P3 holding 2 units of R1 and is requesting 1 unit of R2. P4 holding 2 units of R3 and is requesting 1 unit of R1. Determine whether any process is deadlocked. Describe the procedure to recover from deadlocks. Describe in detail authentication and key distribution in distributed operating system with reference to Kerberos Protocol.

7.

Q6 Q6 Q6 Q6

8.

Q6 Q6 Q6 Q6

Explain in detail sequential and release consistency with suitable examples.

T N

W U
**********

R O

D L

www.jntuworld.com