A framework for viewing atomic events in distributed computations

DOI10.1016/S0304-3975(97)00195-3zbMath0902.68070OpenAlexW1990697576MaRDI QIDQ1128710

Ajay D. Kshemkalyani

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00195-3

zbMATH Keywords

communicationcausalityconcurrencyatomicitydistributed computation

Mathematics Subject Classification ID

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

Related Items (3)

Data-stream-based global event monitoring using pairwise interactions ⋮ Techniques and applications of computation slicing ⋮ Interval consistency of asynchronous distributed computations

Uses Software

• MPI
• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Temporal interactions of intervals in distributed systems.
• On interprocess communication. I: Basic formalism
• How processes learn
• The causal ordering abstraction and a simple way to implement it
• Coupling coefficients of a distributed execution
• A taxonomy of distributed mutual exclusion
• Detecting causal relationships in distributed computations: In search of the holy grail
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• Time, clocks, and the ordering of events in a distributed system
• Strong stable properties in distributed systems
• Synchronous, asynchronous, and causally ordered communication
• Repeatable and portable message-passing programs

This page was built for publication: A framework for viewing atomic events in distributed computations