Paper Details

%T Concurrency Control and Recovery Management for Open e\-Business Transactions
%A Amir R. Razavi, Sotiris K. Moschoyiannis, Paul J. Krause
%E Alistair A. McEwan, Steve Schneider, Wilson Ifill, Peter H. Welch
%B Communicating Process Architectures 2007
%X Concurrency control mechanisms such as turn\-taking,
   locking, serialization, transactional locking mechanism,
   and operational transformation try to provide data
   consistency when concurrent activities are permitted in a
   reactive system. Locks are typically used in transactional
   models for assurance of data consistency and integrity in a
   concurrent environment. In addition, recovery management is
   used to preserve atomicity and durability in transaction
   models. Unfortunately, conventional lock mechanisms severely
   (and intentionally) limit concurrency in a transactional
   environment. Such lock mechanisms also limit recovery
   capabilities. Finally, existing recovery mechanisms
   themselves afford a considerable overhead to concurrency.
   This paper describes a new transaction model that supports
   release of early results inside and outside of a
   transaction, decreasing the severe limitations of
   conventional lock mechanisms, yet still warranties
   consistency and recoverability of released resources
   (results). This is achieved through use of a more flexible
   locking mechanism and by using two types of consistency
   graph. This provides an integrated solution for transaction
   management, recovery management and concurrency control. We
   argue that these are necessary features for management of
   long\-term transactions within "digital
   ecosystems" of small to medium enterprises.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.