In this paper we discuss relationships between client-centric consistency models (known as session guarantees), and data-centric consistency models. The first group includes: read-your-writes guarantee, monotonic-writes guarantee, monotonic-reads guarantee and writes-follow-reads guarantee. The other group includes: atomic consistency, sequential… (More)
This paper presents a new technique of recovery for object based Distributed Shared Memory (DSM) systems. The new technique, integrated with a coherence protocol for atomic consistency model, offers high availability of shared objects in spite of multiple node and communication failures, introducing little overhead. It ensures fast recovery in case of… (More)
Session guarantees are used to manage replica consistency of a distributed system from the client perspective. This paper defines formally the guarantees, presents and proves safety of a protocol implementing session guarantees using server-based version vectors.
Termination detection constitutes one of the basic problems of distributed computing and many distributed algorithms have been proposed to solve it. But all these algorithms consider a very simple model for underlying application programs : for processes of such programs non-deterministic constructs are allowed but each receive statement (request) concerns… (More)
This paper deals with the problem of deadlock detection in asynchronous messages communication systems. The considered system model covers unspecified receptions, not FIFO channels, and general resource (message) requests including, among others, AND, OR,
The paper has originated from the observation that for a certain class of communication protocols, an application of the time interval approach for their modelling and verification may be insufficient. This class includes both competing and supporting events, and considers explicitly the concurrency of events. In this paper we have proposed a polygon time… (More)