0% found this document useful (0 votes)
22 views4 pages

Week 5 Assignment 05

The document contains solutions to a quiz on cloud computing and distributed systems, covering topics such as agreement problems, consensus, and rollback mechanisms. It includes multiple-choice questions with correct answers and explanations for each. Key concepts discussed include Byzantine agreement, synchronous vs asynchronous systems, and various types of messages in distributed systems.

Uploaded by

lokshanadv7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views4 pages

Week 5 Assignment 05

The document contains solutions to a quiz on cloud computing and distributed systems, covering topics such as agreement problems, consensus, and rollback mechanisms. It includes multiple-choice questions with correct answers and explanations for each. Key concepts discussed include Byzantine agreement, synchronous vs asynchronous systems, and various types of messages in distributed systems.

Uploaded by

lokshanadv7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Quiz Assignment-V Solutions: Cloud Computing and Distributed Systems (Week-5)

__________________________________________________________________________________

Q. 1 Consider the given table of agreement problems and match the correct pair:

Agreement Problem Agreement Condition

(P) Byzantine Agreement (i) All processes have an initial value and All non-faulty processes
Problem must agree on the same (single) value.

(ii) All processes have an initial value and All non-faulty processes
(Q) Consensus Problem
must agree on the same array of values A[v1 . . . vn ].

(R) Interactive Consistency (iii) Single source has an initial value and All non-faulty processes
Problem must agree on the same value.

A. (P): (i), (Q): (ii), (R): (iii)


B. (P): (iii), (Q): (ii), (R): (i)
C. (P): (iii), (Q): (i), (R): (ii)
D. (P): (ii), (Q): (iii), (R): (i)

Answer: C) (P): (iii), (Q): (i), (R): (ii)

Q. 2 True or False ?

“Pease showed that in a fully connected network, it is possible to reach an agreement if number of
faulty processors ‘f’ exceeds (n-1)/3 where n = number of processors”.

A. True
B. False

Answer: B) False

Explanation: The correct statement is:

Pease showed that in a fully connected network, it is impossible to reach an agreement if number of
faulty processes ‘f ’ exceeds (n-1)/3 where n is number of processes

Q. 3 True or False ?

“Byzantine agreement cannot be reached among three processors if one processor is faulty”

A. True
B. False

Answer: A) True

Explanation: Byzantine agreement cannot be reached among three processors if one processor is
faulty.
It should be n >= 3f + 1, where n is the total number of processors and f is faulty processors

Q. 4 Consider the following statements:

Statement 1: In the synchronous system model, consensus is impossible to solve

Statement 2: In the asynchronous system model, consensus is solvable

Statement 3: Paxos provides safety and eventual liveness

A. Only Statement 1 is true


B. Only Statement 1 and statement 2 are true
C. Only Statement 2 and statement 3 are true
D. Only Statement 3 is true

Answer: D) Only Statement 3 is true

Explanation: The correct statements are:

Statement 1: In the synchronous system model, Consensus is solvable

Statement 2: In the asynchronous system model, Consensus is impossible to solve

Statement 3: Paxos provides safety and eventual liveness

Q. 5 Find out the correct model for the given assumptions of a system:

Assumption 1: Each message is received within bounded time.

Assumption 2: Drift of each process’ local clock has a known bound.

Assumption 3: Each step in a process takes lb < time < ub , where lb represents lower bound and ub
represents an upper bound.

A. Asynchronous distributed system


B. Synchronous distributed system
C. On demand computing system
D. Parallel processing system

Answer: B) Synchronous distributed system

Explanation: Synchronous Distributed System has following properties:

1. Each message is received within bounded time


2. Drift of each process’ local clock has a known bound
3. Each step in a process takes lb < time < ub
Q. 6 True or False ?

“Koo-Toueg algorithm is a uncoordinated checkpointing and recovery technique that takes a


consistent set of checkpointing and avoids domino effect and livelock problems during the recovery”

A. True
B. False

Answer: B) False

Explanation: Koo and Toueg (1987) proposed a coordinated checkpointing and recovery technique
that takes a consistent set of checkpointing and avoids ‘domino effect’ and ‘livelock problems’ during
the recovery

Q. 7 Messages whose ‘send’ is done but ‘receive’ is undone due to rollback are
called_________________.

A. In-transit message
B. Lost messages
C. Orphan messages
D. Duplicate messages

Answer: B) Lost messages

Q. 8 Cascaded rollback which causes the system to roll back to too far in the computation (even to the
beginning), in spite of all the checkpoints is known as_______________________.

A. Rollback
B. Phantom Effect
C. Domino Effect
D. Livelock

Answer: C) Domino Effect

Q. 9 Messages with ‘receive’ recorded but message ‘send’ not recorded and do not arise if processes
roll back to a consistent global state are called_________________________.

A. In-transit message
B. Lost messages
C. Orphan messages
D. Duplicate messages

Answer: C) Orphan messages

Explanation: Orphan messages: Messages with ‘receive’ recorded but message ‘send’ not recorded
do not arise if processes roll back to a consistent global state.
Q. 10 The ____________________may arise when a process rolls back to its checkpoint after a
failure and requests all the other affected processes also to roll back.

A. Rollback
B. Phantom Effect
C. Domino Effect
D. Livelock problem

Answer: D) Livelock problem

Explanation: The Livelock problem may arise when a process rolls back to its checkpoint after a
failure and requests all the other affected processes also to roll back.

__________________________________________________________________________________

You might also like