Causal ordering is an important property in distributed systems. Several algorithms have
been developed over this principle. For example, there are solutions for roll-back recovery …

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 …

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 …

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 …

Causal ordering in distributed systems has received much attention over the past four
decades and different schemes for capturing causality have been proposed. Despite the fact …

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 …

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 …

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 …

This paper investigates a solution to the problem of causal ordering in messagepassing
distributed systems. Causal ordering is the restriction that messages are delivered in a fo …

A fundamental problem in distributed computing consists in tracking causal dependencies
between relevant events occurring during the computation, named observable events …