[PDF][PDF] MCSR: A graph transformation based approach for Minimal and Compact Set Representation of Causal Dependencies in Distributed Systems.
H Khlif, HH Kacem, SEP Hernández - TACC, 2023 - ceur-ws.org
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 …
been developed over this principle. For example, there are solutions for roll-back recovery …
From the happened-before relation to the causal ordered set abstraction
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 …
Relation (HBR). Most of these works intend to be efficient in their implementation by …
The minimal dependency relation for causal event ordering in distributed computing
SEP Hernández - Applied Mathematics & Information Sciences, 2015 - hal.science
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 …
principle of the Happened-Before Relation (HBR). One common as-pect among them is that …
A mechanism for the causal ordered set representation in large-scale distributed systems
H Khlif, HH Kacem, SEP Hernandez… - 2015 IEEE 24th …, 2015 - ieeexplore.ieee.org
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 …
distributed systems have become an integral part of everyday life with the development of …
SGLC: A Logical Clock Using Succinct Graphs
S Sokoto, E Onur - 2022 30th Signal Processing and …, 2022 - ieeexplore.ieee.org
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 …
decades and different schemes for capturing causality have been proposed. Despite the fact …
Efficient reconstruction of the causal relationship in distributed systems
P Baldy, H Dicky, R Medina, M Morvan… - … -France Conference on …, 1994 - Springer
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 …
formal framework based upon partial orders for this study. The initial algorithm dealing with …
The immediate dependency relation: an optimal way to ensure causal group communication
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 …
(IDR), and we show how by extending the IDR relation, one can ensure a global causal …
Characterization and delivery of directly coupled causal messages in distributed systems
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 …
systems. Violations of causal order delivery normally lead to significant inconsistencies …
[PDF][PDF] Implementing causal ordering with bounded time-stamps
S Krishnamurthy, M Mukund - TCS, 1995 - cmi.ac.in
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 …
distributed systems. Causal ordering is the restriction that messages are delivered in a fo …
Minimal size of Piggybacked Information for tracking causality: a graph-based characterization
JM Hélary, G Melideo - … Workshop on Graph-Theoretic Concepts in …, 2000 - Springer
A fundamental problem in distributed computing consists in tracking causal dependencies
between relevant events occurring during the computation, named observable events …
between relevant events occurring during the computation, named observable events …