Cloud CM-IPMP Guía para resolver problemas Pagina 194

  • Descarga
  • Añadir a mis manuales
  • Imprimir
  • Pagina
    / 201
  • Tabla de contenidos
  • MARCADORES
  • Valorado. / 5. Basado en revisión del cliente
Vista de pagina 193
Appendix D
Transactions
D.1 Introduction
This appendix provides a brief overview of transactions and transaction processing systems including the ACID properties of
Transactions, various Concurrency Control Models, components of a transaction processing system and commit protocols.
Transactions are a part of the JAIN SLEE event and programming models, therefore it is important that these concepts are
understood. Rhino provides a sophisticated transaction processing system, and is able to trade durability with performance in a
number of ways.
D.2 ACID Properties
The ACID properties of transactions greatly simplify both the normal runtime logic of an application (in terms of concurrency
control, and updates to state), and the failure-recovery logic of applications. Very briefly these properties are:
Atomicity - A transaction either completes successfully, and the effects of all of its operations are recorded, or it has no
effect at all.
Consistency - A transaction takes the state of the system from one consistent state to another consistent state.
Isolation - Each transaction is performed without interference from other transactions; in other words, the intermediate
effects of a transaction are not visible to other transactions.
Durability - After a transaction has completed successfully, its effects are saved to storage. The storage may be non-
volatile or volatile.
D.3 Concurrency Control Models
There are two general approaches for supporting isolation in a transacted environment. These are pessimistic and optimistic
concurrency control.
This appendix describes the high level approach taken for pessimistic and optimistic concurrency control. It is intended to
provide the developer and administrator knowledge of the general approaches, as the algorithms used to support pessimistic and
optimistic concurrency control vary depending on the underlying Resource Manager (for example different relational databases
may support one and not the other, or may use different variations of algorithms than those described here).
D.3.1 Pessimistic Concurrency Control
Under the pessimistic model the resource manager acquires a lock (shared or exclusive depending on the semantics of the
access) as each addressable unit of transacted state is first accessed. Units of transacted state in JAIN SLEE include SBB
185
Vista de pagina 193

Comentarios a estos manuales

Sin comentarios