Distributed Computing(Department Elective - II) — Winter 2018

Differentiate tightly coupled and loosely coupled multiprocessor system.

What is buffering? Explain different types of buffering in brief.

Explain issues related to designing of distributed operating system.

Compare blocking and non-blocking primitives of IPC.

Network system protocols are unsuitable for distributed systems. Explain.

What is non-idempotent routine? How such routine creates problem with message passing? Also explain its solution with example.

Enumerate the various issues in clock synchronization. Classify the clock synchronization algorithms and explain Berkeley algorithm with an example.

Compare CBR and VBR traffics in ATM system

Demonstrate the features of “Google” that covers the Distributed Operating System.

What is ordered message delivery? Discus different types of message ordering.

List out desirable features of a good message-passing system. Explain any three.

Explain the following call semantics: (1) At least once (2) Exactly once

Explain the probe based distributed algorithm for deadlock detection.

Explain the reasons for drift in the computer clocks

Explain the Bully algorithm with example.

Explain RPC implementation. Also explain various methods of generating stubs.

What is deadlock? Discuss the necessary and sufficient conditions for a deadlock to occur.

Compare RPC and RMI with example.

Enumerate the major differences between threads and processes. Discuss various thread models.

Explains various categories of faults.

Explain Thrashing and False sharing in Distributed shared memory.1

What are the issues related in designing human oriented names explain in brief.

What is name server?

What are the fundamental issues in resource management in distributed system?

Discuss on Design and Implementation issues of Distributed shared Memory