Slides for Chapter 14 Distributed transactions.ppt

Slides for Chapter 14: Distributed transactions From Coulouris, Dollimore and KindbergDistributed Systems:  Concepts and Design Edition 4, ? Addison-Wesley 2005 Commitment of dist. trans. - intro A distributed transaction refers to a flat or nested transaction that accesses objects managed by multiple servers Atomicity must still be preserved A process on one of the servers is coordinator, it must ensure the same outcome at all of the servers. The ‘two-phase commit protocol’ is the most commonly used protocol for achieving this Fig 14.1 Distributed transactions Fig. 14.2 Nested banking transaction Fig. 14.3 A dist. banking transaction Fig. 14.4 Ops for 2PC Fig. 14.5 Two-phase commit protocol Fig. 14.5 Two-phase commit protocol Fig. 14.6 Comm in 2PC protocol Summary of 2PC a distributed transaction involves several different servers. A nested transaction structure allows additional concurrency and independent committing by the servers in a distributed transaction. atomicity requires that the servers participating in a distributed transaction either all commit it or all abort it. continued ... Summary of 2PC atomic commit protocols are designed to achieve this effect, even if servers crash during their execution. the 2PC protocol allows a server to abort unilaterally. it includes timeout actions to deal with delays due to servers crashing. 2PC protocol can take an unbounded amount of time to complete but is guaranteed to complete eventually. 14.5 Distributed deadlocks Single server transactions can experience deadlocks prevent or detect and resolve use of timeouts is clumsy, detection is preferable. it uses wait-for graphs. Distributed transactions lead to distributed deadlocks in theory can construct global wait-for graph from local ones a cycle in a global wait-for graph that is not in local ones is a distributed deadlock 14.6 Transaction recovery Atomicity property of transactions durability and failure atomicity durability requires that objects ar