Toggle Main Menu Toggle Search

Open Access padlockePrints

Understanding the Role of Atomic Transactions and Group Communications in Implementing Persistent Replicated Objects

Lookup NU author(s): Professor Mark Little, Emeritus Professor Santosh Shrivastava

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

A widely used computational model for constructing fault-tolerant distributed applications employs atomic transactions for controlling operations on persistent objects. There has been considerable work on data replication techniques for increasing the availability of persistent data that is manipulated under the control of transactions. Process groups with ordered group communications has also emerged as model for building available distributed applications. High service availability can be achieved replicating the service state on multiple processes managed by a group communication infrastructure. These two models are often seen as rivals. This paper explores the role of these models in building fault-tolerant distributed applications. The paper develops a general model of distributed persistent objects and investigates how such objects can be replicated for availability using a system that supports only: (i) transactions; and (ii) process groups. A comparative evaluation shows how the two models be used together to provide a more flexible approach to supporting high availability applications.


Publication metadata

Author(s): Little MC, Shrivastava SK

Editor(s): Morrison, R., Jordan, M.J. and Atkinson, M.P.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 8th International Workshop on Persistent Object Systems: Design, Implementation and Use (POS8), Advances in Persistent Object Systems

Year of Conference: 1999

Pages: 17-28

Publisher: Morgan Kaufmann

Library holdings: Search Newcastle University Library for this item

ISBN: 1558605851


Share