Several algorithms of different domains in distributed systems are designed over the
principle of the Happened-Before Relation (HBR). One common as-pect among them is that …

Several works in distributed systems have been designed based on the Happened-Before
Relation (HBR). Most of these works intend to be efficient in their implementation by …

Causal Order (CO) is an important but basic property of message-passing based distributed
systems. Violations of causal order delivery normally lead to significant inconsistencies …

In this paper we present a study on the subject of the Immediate Dependency Relation
(IDR), and we show how by extending the IDR relation, one can ensure a global causal …

An important problem in analyzing distributed computations is the amount of information. In
event-based models, even for simple applications, the number of events is large and the …

This paper analyzes computation of causality relationships in distributed systems. We give a
formal framework based upon partial orders for this study. The initial algorithm dealing with …

Causal message ordering is a partial ordering of messages in a distributed computing
environment. It places a restriction on communication between processes by requiring that if …

Distributed systems have undergone a very fast evolution in the last years. Large-scale
distributed systems have become an integral part of everyday life with the development of …

This paper presents a new algorithm to implement causal ordering. Causal ordering was first
proposed in the ISIS system developed at Cornell University. The interest of causal ordering …

A significant shortcoming of causal message ordering systems is their inefficiency because
of false causality. False causality is the result of the inability of the “happens before” relation …