Slides for Chapter 13 Transactions and Concurrency Control.ppt

Slides for Chapter 13: Transactions and Concurrency Control From Coulouris, Dollimore and KindbergDistributed Systems:  Concepts and Design Edition 3, ? Addison-Wesley 2005 Introduction to transactions The goal of transactions the objects managed by a server must remain in a consistent state when they are accessed by multiple transactions and in the presence of server crashes Recoverable objects can be recovered after their server crashes objects are stored in permanent storage Failure model transactions deal with crash failures of processes and omission failures of communication Designed for an asynchronous system Figure 13.1Operations of the Account interface Figure 13.2A client’s banking transaction Atomic operations at server when a server uses multiple threads it can perform several client operations concurrently if we allowed deposit and withdraw to run concurrently we could get inconsistent results objects should be designed for safe concurrent access e.g. in Java use synchronized methods, e.g. public synchronized void deposit(int amount) throws RemoteException atomic operations are free from interference from concurrent operations in other threads. use any available mutual exclusion mechanism (e.g. mutex) Client cooperation by means of synchronizing server operations servers with multiple threads require atomic objects but in some applications, clients depend on one another to progress e.g. one is a producer and another a consumer e.g. one sets a lock and the other waits for it to be released it would not be a good idea for a waiting client to poll the server to see whether a resource is yet available it would also be unfair (later clients might get earlier turns) Java wait and notify methods allow threads to communicate with one another and to solve these problems e.g. when a client requests a resource, the server thread waits until it is notified that the resource is available Figure 13.3Operations in Coordinator interface Figure 13.4Trans