Distributed Computing Q&A regarding the homework


More recent questions will be at the beginning (top) of the page.

Q&A Homework 3:





> Question - about q2:
> Can we (or should we) relate to anytime a processor send V to all (king or in
> exchange 1,2) ,
>
> It means it also send V to ‘himself’?
YES.


> I have a few questions about Q1:
> 1.I did not understand the meaning of "king-M" in the pseudo - code, what is
> it?
King-M is the name of a variable into which the message received from the king
process at this phase is stored.

I.e., in Exchange 2 of phase $k$ the message I receive from process k is
stored in my local variable king-M.
> Does the message has constant size as in the algorithm presented in class?
YES


YES
> Since you wrote in a previous answer that the ring is bi-directional, am
> I right in saying that when a bi-directional link is cut then messages
> are lost in both directions?


> 3. (Q4) I assume we are using a Bi-Directional ring in this quetion - is this
> correct?
YES
> 4. (Q4) What complexity are you reffering to - time, message, bit?
Messages.


Any subset may spontaneously start the algorithm.
> In question 3, is there a designated leader, which initiates the algorithm,
> or may some subset initiate it?