By Topic

Transaction failure tolerance without loss of concurrency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Turc, S. ; Centre de Res. en Inf., Languedoc Univ., Montpellier

Two recovery algorithms are described: one to achieve failure tolerance of sequential transactions that read or write object, and the other to achieve failure tolerance of sequential transactions that manipulate typed objects and act on the outside world. Both require the two-phase transaction model and do not interfere with concurrency. It could be argued that the second one induces overheads in writing data to stable storage. However, it is believed that these overheads can be more easily dealt with than a loss of concurrency

Published in:

Distributed Computing Systems in the 1990s, 1988. Proceedings., Workshop on the Future Trends of

Date of Conference:

14-16 Sep 1988