How to make a recoverable server by synchronization code inheriting

Authors:
A. Romanovsky
Affiliations:
-
Venue:
ACM SIGPLAN OOPS Messenger
Year:
1995

Citing 5
Cited 0

ABCL: an object-oriented concurrent system

ABCL: an object-oriented concurrent system
GUIs: the next generation

Communications of the ACM - Special issue on graphical user interfaces
Highly efficient and encapsulated re-use of synchronization code in concurrent object-oriented languages

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Fault Tolerance: Principles and Practice

Fault Tolerance: Principles and Practice
An Overview of the Arjuna Distributed Programming System

IEEE Software

Quantified Score

Hi-index	0.00

Visualization

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.