Detecting causal relationships in distributed computations: In search of the holy grail

DOI10.1007/BF02277859zbMath0813.68096MaRDI QIDQ1331790

Reinhard Schwarz, Friedemann Mattern

Publication date: 29 August 1994

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

distributed debuggingdistributed programstimestampscausal relationshipsglobal predicate detection

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (25)

Formalization of Habanero phasers using Coq ⋮ Abstractions for fault-tolerant global computing ⋮ Unnamed Item ⋮ On the diversity of asynchronous communication ⋮ Shared global states in distributed computations ⋮ A framework for viewing atomic events in distributed computations ⋮ Causal behaviours and nets ⋮ Efficient detection of restricted classes of global predicates ⋮ Reasoning about non-immediate triggers in biological networks ⋮ Data-stream-based global event monitoring using pairwise interactions ⋮ Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) ⋮ Concise version vectors in WinFS ⋮ Necessary and sufficient conditions on information for causal message ordering and their optimal implementation ⋮ Causality tracking in causal message-logging protocols ⋮ The power of logical clock abstractions ⋮ Efficient online algorithm for identifying useless states in distributed systems ⋮ Byzantine-tolerant causal broadcast ⋮ Calculs approchés de la borne inférieure de valeurs réparties ⋮ Crash-tolerant causal broadcast in \(O(n)\) messages ⋮ Unnamed Item ⋮ Understanding Distributed Program Behavior Using a Multicast Communication Scheme ⋮ A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition ⋮ GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS ⋮ On the minimal information to encode timestamps in distributed computations. ⋮ Consistency verification in transaction-based optimistic steering of distributed computations

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval graphs and interval orders
• Modeling concurrency with partial orders
• Inevitability in concurrent systems
• Petri nets, event structures and domains. I
• Concerning the size of logical clocks in distributed systems
• The causal ordering abstraction and a simple way to implement it
• An efficient implementation of vector clocks
• Global conditions in debugging distributed programs
• Concurrent common knowledge: Defining agreement for asynchronous systems
• Verification of distributed programs using representative interleaving sequences
• Recording distributed snapshots based on causal order of message delivery
• Interleaving set temporal logic
• Recovery in distributed systems using optimistic message logging and checkpointing
• Time, clocks, and the ordering of events in a distributed system
• Exploiting locality in maintaining potential causality
• A Theorem on Boolean Matrices

This page was built for publication: Detecting causal relationships in distributed computations: In search of the holy grail