并行程序设计11并行计算系统同步.pptVIP

* * * * * * * * * * * * * * * * * * * * * A Comparison of the Three Algorithms Algorithm Messages per entry/exit Delay before entry (in message times) Problems Centralized 3 2 Coordinator crash Distributed 2 ( n – 1 ) 2 ( n – 1 ) Process crash Token ring 1 to ? 0 to n – 1 Lost token, process crash Centralized is the most efficient. Token ring efficient when many want to use critical region. * Idea A process enter CS when part of other processes promise Performance Bandwidth utilization No release messages: Have release messages: Better than 2(N-1) if N4 Client delay: a round trip time Same as multicast algorithm The improved algorithm A total order of each request The wait-for operation executes in accordance with the total order Maekawa’s voting algorithm * 1. Distributed mutual exclusion 2. Elections 3. Summary Outline * Election Algorithms Many distributed algorithms such as mutual exclusion and deadlock detection require a coordinator process. When the coordinator process fails, the distributed group of processes must execute an election algorithm to determine a new coordinator process. These algorithms will assume that each active process has a unique priority id. * Election Choose a unique process to play a particular role Define the election: choose the largest identifier E.g. for electing the process with lowest load, then id = 1/load Evaluate the performance of election algorithm Total bandwidth utilization Turnaround time The number of serialized message transmission times between the initiation and termination of a single run Some concepts about Election algorithm * Assumption Synchronous system Use timeout to detect a process failure Reliable failure detector Process can communicate with processes which have higher identifiers higher processes lower processes The bully algorithm * The bully algorithm The Bully Algorithm 1. P sends an ELECTION message to all processes with higher numbers. 2. If no one responds, P wins the election and becomes co