jerrybreecher.pptVIP

18: Distributed Coordination Jerry Breecher DISTRIBUTED COORDINATION Topics: ? Event Ordering Mutual Exclusion Atomicity Concurrency Control Deadlock Handling Election Algorithms Reaching Agreement DISTRIBUTED COORDINATION Definitions: ? Tightly coupled systems: ? Same clock, usually shared memory. Communication is via this shared memory. Multiprocessors. ? Loosely coupled systems: ? Different clock. Use communication links. Distributed systems. DISTRIBUTED COORDINATION Happening before vs. concurrent. ? Here A -- B means A occurred before B and thus could have caused B. Of the events shown on the next page, which are happened-before and which are concurrent? Ordering is easy if the systems share a common clock ( i.e., its in a centralized system.) With no common clock, each process keeps a logical clock. This Logical Clock can be simply a counter - it may have no relation to real time. Adjust the clock if messages are received with time higher than current time. We require that LC( A ) LC( B ), the time of transmission be less than the time of receipt for a message. So if on message receipt, LC( A ) = LC( B ), then set LC( B ) = LC( A ) + 1. DISTRIBUTED COORDINATION Here’s the problem we have to solve. Suppose two processes want to gain two locks. For a single system approach, we learned that deadlock could be avoided by assuring that the locks are always attained in the same order: P1: P2: wait(Q); wait(Q); wait(S); wait(S); signal(S); signal(Q); signal(Q); signal(S); To make this work, we need to maintain strict Happening Before relationships. DISTRIBUTED COORDINATION USING DISTRIBUTED SEMAPHORES ? With only a single machine, a processor can provide mutual exclusion. But its much harder to do with a distributed system. The network may not be fully connected so communication must be through an intermediary machine. Concerns center around: 1.