P1, P2 ... P6 are 6 hosts in a distributed system and ID(Pi) > ID(Pj) if i > j.
ID: 3535870 • Letter: P
Question
P1, P2 ... P6 are 6 hosts in a distributed system and ID(Pi) > ID(Pj) if i > j. If Pi and Pj are directly connected, their communication latency is given as CL(Pi, Pj).
Given:
CL(P1, P2)=5, CL(P1, P6)=8, CL(P2, P5)=8, CL(P2,P6)=7,
CL(P3, P4)=4, CL(P3, P5)=6, CL(P3, P6)=5, CL(P4,P5)=3,
CL(P4, P6)=6, CL(P5, P6)=4
If Pi and Pj are not directly connected, then a path with minimum latency will be used. Assume that the system coordinator is the host with the highest ID and a new coordinator will be elected by the token-ring algorithm if the current coordinator is down.
Assume a logic token ring is set as
{P1 -> P2 -> P5 -> P4 -> P3 -> P6 -> P1}.
Assume that each host periodically requests resources every 35 ticks and P1 starts at t=0, P2 starts at t=7 tick, P3 starts at t=14 tick, P4 starts at t=21 tick, and P5 starts at t=28 tick. Assume that the associated communication gears remain intact if a host goes down.
If P6 goes down at t=79, answer the following questions:
a) When does a host first find out P6 was down and which host is it?
b) When will a new coordinator Pk realize it is the new coordinator?
c) If the communication gear goes down with the host, what will be happening?
Please show work/gannt chart for good rating.
Explanation / Answer
If no one answers please rate me.....plzzz......
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.