Interval approximations of message causality in distributed executions

DOI10.1007/3-540-55210-3_197MaRDI QIDQ5096795zbMATH OpenOpenAlexFDO

Authors Claire Diehl, Claude Jard

Publication date 18 August 2022

Published in STACS 92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55210-3_197

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Time-message trade-offs in distributed algorithms
• Interval consistency of asynchronous distributed computations
• Causality and atomicity in distributed computations
• Crash-tolerant causal broadcast in \(O(n)\) messages
• Bounded time-stamping in message-passing systems
• An optimal algorithm for distributed snapshots with causal message ordering
• scientific article; zbMATH DE number 1286115
• Message and time efficient consensus protocols for synchronous distributed systems
• Vector time and causality among abstract events in distributed computations
• Causal computational complexity of distributed processes

Cites work

• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• An axiomatic approach to distance on partial orderings
• Concerning the size of logical clocks in distributed systems
• Scheduling Interval-Ordered Tasks
• Time, clocks, and the ordering of events in a distributed system

Cited in

(11)

• scientific article; zbMATH DE number 1863250 (Why is no real title available?)
• Time stamps for fixed-point approximation
• Effectiveness of delaying timestamp computation
• scientific article; zbMATH DE number 2080851 (Why is no real title available?)
• On the minimal information to encode timestamps in distributed computations.
• Time-stamps for Mazurkiewicz traces.
• Interval consistency of asynchronous distributed computations
• An optimal algorithm for distributed snapshots with causal message ordering
• Timestamping messages and events in a distributed system using synchronous communication
• Reachability analysis on distributed executions
• Asynchronous message orderings beyond causality

This page was built for publication: Interval approximations of message causality in distributed executions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096795)