Scribd
Upload
12 views

Distributed Systems - Unit 7 - Week 5

Uploaded by

S M LAKKAVARAM (RA2111030010201)
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Distributed Systems - Unit 7 - Week 5

Uploaded by

S M LAKKAVARAM (RA2111030010201)
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

8/30/23, 9:21 PM Distributed Systems - - Unit 7 - Week 5

Assessment submitted.
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
X

[email protected]

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Distributed Systems (course)

If already
registered, click
Thank you for taking the Week 5:
to check your
payment status
Assignment 5.

Course Week 5: Assignment 5


outline Your last recorded submission was on 2023-08-30, 21:21 Due date: 2023-08-30, 23:59 IST.
IST
How does an
1) What does the sender process await in the second phase from its viewpoint in 1 point
NPTEL
the three-phase distributed algorithm?
online
course Replies from the receiver processes.
work? ()
Replies from other senders in the group.
Replies from all processes in the distributed system.
Week-0 ()
The final timestamp from the multicaster.
Week 1 ()
2) Consider the dijkstra's self-stabilizing token ring system. A legitimate state must 1 point
Week 2 () satisfy the following constraints:

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


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

Week 4 () 3) During an infinite execution, each machine should enjoy a privilege an infinite number of times
(no starvation).
Week 5 () 4) Given any two legal states, there is a series of moves that change one legal state to the
other (reachability).
Termination
Detection in All constraints are false
Distributed All constraints are true
System (unit?
Constraint 1&2 are true and Constraint 3&4 are false
unit=47&lesso
n=48) Constraint 1&2 are false and Constraint 3&4 are true

Message
3) What are the issues in the design of self-stabilization algorithms. 1 point
Ordering and
Group Number of states in each of the individual units in a distributed system.
Communicatio
n (unit?
Uniform and non-uniform algorithms in distributed systems.

https://onlinecourses.nptel.ac.in/noc23_cs72/unit?unit=47&assessment=126 1/3
8/30/23, 9:21 PM Distributed Systems - - Unit 7 - Week 5

unit=47&lesso Reducing the number of states in a token ring.


Assessment
n=49)submitted.
X All of the mentioned.
Self-
Stabilization 4) In the algorithm developed by Topor (1984), what is the purpose of turning a 1 point
process from white to black?
(unit?
unit=47&lesso
To indicate that the process has received a token from its parent.
n=50)
To indicate that the process has terminated.
Week 5:
To indicate that the process has sent a message to another process.
Lecture Notes
(unit? To indicate that the process is in an idle state.
unit=47&lesso
n=52) 5) Determine the accurate relationship among various message ordering 1 point
paradigms, denoted by SYNC, FIFO, A, and CO, where SYNC represents
Quiz: Week 5: synchronous order, FIFO denotes first-in-first-out order, A signifies arbitrary order, and CO
Assignment 5 stands for causal order.
(assessment?
name=126) SYNC ⊂ CO ⊂ FIFO ⊂ A

Feedback for
SYNC ⊂ FIFO ⊂ A ⊂ CO
Week 5 (unit? SYNC ⊂ FIFO ⊂ CO ⊂ A
unit=47&lesso A ⊂ FIFO ⊂ CO ⊂ SYNC
n=51)

Week 6 () 6) What is the worst-case complexity of the algorithm developed by Topor, 1 point
considering N as the number of processes and M as the number of
computation messages exchanged?
DOWNLOAD
VIDEOS () O(N)
O(N^2)
Text
O(log N)
Transcripts ()
O(N*M)
Books ()
7) In the third phase of the sender's viewpoint in the three-phase distributed 1 point
algorithm, what does the process do?

Multicasts the message with a proposed timestamp.


Awaits replies from the receiver processes.
Computes the maximum proposed timestamp and multicasts the final timestamp.
Sorts the messages in the queue based on their tags.

8) What is the significance of the closure property in Dijkstra's three-state 1 point


algorithm?

It ensures that no deadlocks occur in any state.


It guarantees that the system maintains at least one privilege in each state.
It enables each machine to make more than one move.
It ensures that the system can transition from one legal state to another.

9) What is the message complexity of the three-phase algorithm, considering n as1 point
the number of destinations and (n – 1) as the number of messages for these
destinations?

2(n − 1) messages
3(n − 1) messages

https://onlinecourses.nptel.ac.in/noc23_cs72/unit?unit=47&assessment=126 2/3
8/30/23, 9:21 PM Distributed Systems - - Unit 7 - Week 5

4(n − 1) messages
Assessment submitted.
X n messages
10) In Dijkstra's self-stabilizing token ring system, what forms the basis for 1 point
determining whether a machine has the privilege to make a move?

Its position in the ring.


Its total number of transitions made.
The total number of states it can transition to.
A Boolean predicate involving its current state and its neighbors' states.
You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers

https://onlinecourses.nptel.ac.in/noc23_cs72/unit?unit=47&assessment=126 3/3

You might also like