distributed system quiz 2

A state in which a process has finished its computation and will not restart any action unless it receives a message is called as

• Partially terminated state

• Locally terminated state

• Globally terminated state

• Terminating state

In spanning-tree-based termination detection algorithm of Topor, the best case message complexity is ______________and worst case complexity of the algorithm is_______,where N is the number of processes and M is the number of computation messages exchanged

• O(N), O(M)

• O(N), O(N*M)

• O(N2), O(N2)

• O(M), O(N)

Q. 3 Consider the following statements about termination detection (TD) algorithm

Statement 1: Execution of a termination detection algorithm cannot indefinitely delay the underlying computation.

Statement 2: The termination detection algorithm required addition of new communication channels between processes.

• Statement 1 is true and statement 2 is false

• Statement 1 is false and statement 2 is true

• Both statements are false

• Both statements are true

Find out the correct relation between the different message ordering paradigms, where SYNC, FIFO, A and CO denote the set of all possible executions ordered by synchronous order, FIFO order, non-FIFO order and causal order respectively

• SYNC ⊂FIFO⊂A⊂CO

• SYNC ⊂FIFO⊂CO⊂A

• SYNC ⊂CO⊂FIFO⊂A

• A ⊂FIFO⊂CO⊂SYNCH

Consider the dijkstra's self-stabilizing token ring system.A legitimate state must satisfy the following constraints:

1) There must be at least one privilege in the system ( liveness or no deadlock).

2) Every move from a legal state must again put the system into a legal state (closure).

3) During an infinite execution, each machine should enjoy a privilege an infinite number of times (no starvation).

4) Given any two legal states, there is a series of moves that change one legal state to the other (reachability).

• All constraints are false

• All constraints are true

• Constraint 1&2 are true and Constraint 3&4 are false

• Constraint 1&2 are false and Constraint 3&4 are true

As proven by Ghosh, the minimum number of states required in a self-stabilizing ring is:

• 1

• 2

• 3

• 4

Consider the following statements about three phase distributed algorithm

Statement 1: The three phase distributed algorithm is closely structured along the lines of Lamport’s algorithm for mutual exclusion.

Statement 2: This algorithm uses 3(n − 1) messages for n − 1 destinations.

• Statement 1 is true and statement 2 is false

• Statement 1 is false and statement 2 is true

• Both statements are false

• Both statements are true

What is RMI stands for?

• Remote Method Invocation

• Random Method Innovation

• Remote Mathematics Innovation

• Random Mathematics Invocation

RMI uses a layered architecture; each of the layers could be enhanced or replaced without affecting the rest of the system.

• True

• False

RMI is a server-side component; It is not required to be deployed on the server.

• True

• False