Abstract In a Distributed System with N sites, the detection of causal relationships between
events can only be done with vector clocks of size N. This gives rise to scalability and …

This paper presents a scalable scheme for ensuring causal ordering of messages passing
among processes in large-scale distributed systems. Previously proposed approaches …

A causal ordering protocol ensures that if two messages are causally related and have the
same destination, they are delivered to the application in their sending order. Causal order …

This paper is concerned with the problem of making causal inferences from observational
data, when the underlying causal structure may involve feedback loops. In particular, making …

Distributed applications have often to determine consistent cuts (global states) in order to
ensure virtual synchrony between independent tasks. Moreover most of the sequential …

A distributed computation can be modeled as a partially ordered set (poset) of relevant
events (the relevant events are the subset of the primitive events that are meaningful for an …

In this paper we present a scalable causality-tracking protocol, called k-Dependency
Vectors, which piggybacks on each application message a constant number k of integers …

Directed acyclic graphs (DAGs) are effective for compactly representing causal systems and
specifying the causal relationships among the system's constituents. Specifying such 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 …

The emergence of mobile computing devices, such as notebook computers and personal
digital assistants with communication capabilities, has had a signi cant impact on distributed …