Distributed Computing(Department Elective - II) — Winter 2019

Enlist and explain design issues in distributed systems.

Explain any two communication protocol of distributed computing.

Enlist and explain distributed computing models with their advantages and disadvantages.

Explain process addressing techniques.

Compare and contrast blocking and non-blocking primitives of IPC.

Explain what is message passing. Explain the message passing approaches in distributed computing.

Explain RPC either using diagram and theory or using echo client-server program.

Explain any one mutual exclusion algorithm.

Explain multi datagram messaging.

Explain constructing a DFS spanning tree with and without a specified root.

Compare distributed computing and network computing.

Explain fault tolerance ways in distributed computing.

Explain RMI either using diagram and theory or using echo client-server program.

Enlist and explain the problems with unsynchronized clocks.

Explain need of Process migration. Enlist and explain the ways to do it.

Explain logical clock in distributed computing using example.

Compare and contrast leader election in rings.

Explain the terms global state and local state. Explain any algorithm of global state management.

Enlist and explain how process management is implemented in distributed computing.

Explain implementation issues of distributed shared memory.

Explain resource management in distributed computing.1

Differentiate between deadlocks in distributed systems vs. centralized systems. Explain any deadlock handling algorithm in distributed computing.

Differentiate between mutual exclusion algorithms in centralized system vs. distributed computing.

Explain thrashing in distributed computing. Enlist and explain the ways to deal with it.

Explain object locating mechanisms. Enlist and explain issues in designing human oriented names.