ePrints

How to Make a Recoverable Server by Synchronization Code Inheriting

Lookup NU author(s): Professor Alexander RomanovskyORCiD

Downloads

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

Abstract

We consider the practical problem of facilitating the re-design of the servers implemented in concurrent OO languages in such a way that these new servers will be recoverable. On the one hand, any ad hoc approaches to this re-design can be quite error prone. On the other hand, it would be important to reuse the most part of the initial servers' code. That is why we are trying to find quite a routine way to change a server behaviour by inheriting from its initial super class. We use the last achievements in the field of inheriting synchronization code to solve this problem. It is not a paper about new features for COOLs but this is a paper about how new features of COOLs can be used in one specific field: fault tolerance of concurrent systems.

Publication metadata

Author(s): Romanovsky A

Publication type: Article

Publication status: Published

Journal: OOPS Messenger

Year: 1995

Volume: 6

Issue: 1

Pages: 7-13

Print publication date: 01/01/1995

ISSN (print): 1055-6400

Publisher: ACM Press

URL: http://dx.doi.org/10.1145/209866.209868

DOI: 10.1145/209866.209868

Altmetrics

Share