分布式算法课件3.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * A Highly Symmetric Ring Sn Let pi s id be rev(i) , the integer whose binary representation using log n bits is the reverse of i s binary rep. Example: For technical reasons, then multiply id by n+1 p3 p2 p1 p0 2 3 0 1 0 15 5 10 * Anonymous Rings Revisited Leader election is impossible in anonymous rings No way to break symmetry No deterministic algorithm which works in every execution Another way to break symmetry, which works in some (but not all) executions is to use randomization. * Randomized Algorithm In each computation step, the processor receives an additional input to its state transition function, a random number. * Revised LE Problem Definition Weakened problem definition compared to original: At most one leader is elected in every state of every admissible execution same as previous definition At least one leader is elected with high probability. weaker than previous definition But what does with high probability mean? CPSC 668 Set 5: Synchronous LE in Rings * Randomized LE Algorithm Assume synchronous model Initially: set id to 1 with probability 1 - 1/n and to 2 with probability 1/n send id to left When msg M is received: if M contains n ids then if id is unique maximum in M then elect self else not elected else append id to M and send to left * Analysis of Randomized LE Alg. Uses O(n2) msgs There is never more than one leader Sometimes there is no leader leader is only elected if there is exactly one processor that sets its id to 2 How often is there no leader, i.e., what is the probability? Need some more definitions… * Random Choices and Probabilities Since system is synchronous, an admissible execution of the algorithm is determined solely by the initial random choices. Call this collection random choices RC = r0, r1, …, rn-1 where each ri is either 1 or 2. Let exec(RC) be the resulting execution. Definition: For any predicate P on