7. The algorithm to implement synchronous order by scheduling messages, as given in Figure 6.10, uses process
Question:
7. The algorithm to implement synchronous order by scheduling messages, as given in Figure 6.10, uses process identifiers to break cyclic waits.
(a) Analyze the fairness of this algorithm.
(b) If the algorithm is not fair, suggest some ways to make it fair.
(c) Will the use of rotating logical identifiers in crease the fairness of ther algorithm?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Distributed Computing Principles Algorithms And Systems
ISBN: 9780521876346
1st Edition
Authors: Ajay D. Kshemkalyani, Mukesh Singhal
Question Posted: