Set No.

Code No.: 421501

IV-B.Tech. II-Semester Examinations April 2003

DISTRIBUTED SYSTEMS
1
(Computer Science and Systems Engineering)

Time: 3 Hours Max. Marks: 80

Answer any five questions
All questions carry equal marks
---

1. Explain the design issues for Distributed systems.

2. Explain the following algorithms

a) Cristian algorithm b) Distributed deadlock detection algorithm.

3.a) Explain the communication in real time distributed systems

b) Explain Real-time Scheduling.

4.a) Compare methods for dealing with shared files in a distributed system.
b) Explain file replication methods.

5. Explain page-based distributed shared Memory.

6. Explain Memory management in MACH.

7. Explain about threads package in DCE.

8. Write notes on
a) Group communication
b) Fault tolerance in Distributed systems.

^^^
 Set No.
Code No.: 421501
IV-B.Tech. II-Semester Examinations April 2003

DISTRIBUTED SYSTEMS
2
(Computer Science and Systems Engineering)

Time: 3 Hours Max. Marks: 80

Answer any five questions
All questions carry equal marks
---

1.a) Explain the layer structure for ATM networks.

b) Compare and contrast centralized systems and Distributed systems.

2. Explain the following algorithms

a) Distributed algorithm for mutual exclusion
b) Two phase locking concurrency control algorithm

3. Explain various ways of modeling distributed systems.

4. Explain the Sun’s Network file system.

5.a) Explain Memnet architecture

b) Explain Dash protocols in switched multiprocessors

6. Explain about communication in MACH.

7. Compare and contrast threads implementation methods in Distributed systems.

8. Write notes on
a) Remote Procedure Call
b) Time service in DCE.

^^^
 Set No.
Code No.: 421501
IV-B.Tech. II-Semester Examinations April 2003

DISTRUBUTED SYSTEMS
3
(Computer Science and Systems Engineering)

Time: 3 Hours Max. Marks: 80

Answer any five questions
All questions carry equal marks
---

1. Compare and contrast Distributed Systems with other models.

2. Explain Client-Server model of communication.

3. Explain the following algorithms.

a) Bully’s algorithm for coordinator detection
b) Time stamp based algorithm for concurrency control.

4.a) Explain design and implementation issues for processor allocation.

b) Explain centralized algorithm for processor allocation.

5.a) Explain distributed file system design

b) Give four algorithms for managing a client file cache.

6. Explain page-based distributed shared memory.

7. Explain DTS implementation in DCE.

8. Write notes on
a) Unix simulation in MACH.
b) Atomic transactions.

^^^
 Set No.
Code No.: 421501
IV-B.Tech. II-Semester Examinations April 2003

DISTRIBUTED SYSTEMS
4
(Computer Science and Systems Engineering)

Time: 3 Hours Max. Marks: 80

Answer any five questions
All questions carry equal marks
---

1. Explain design issues for distributed systems.

2. Explain about ATM networks.

3.a) Explain logical way of achieving clock synchronization using Lamports

algorithm.
b) Explain distributed algorithm for coordinator detection.

4.a) Explain about workstation algorithm.

b) Explain about scheduling in real time distributed systems.

5. Explain Distributed file system implementation.

6. Explain Shared variable distributed Shared memory.

7. Explain process management in MACH.

8. Write any two

a) Distributed deadlock prevention.
b) Group communication.

^^^