Interval consistency of asynchronous distributed computations
From MaRDI portal
Publication:1608322
DOI10.1006/JCSS.2001.1819zbMath1013.68129OpenAlexW2037157422MaRDI QIDQ1608322
Jean-Michel Helary, Achour Mostefaoui, Michel Raynal
Publication date: 4 August 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2001.1819
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (3)
Communication Patterns and Input Patterns in Distributed Computing ⋮ From the happened-before relation to the causal ordered set abstraction ⋮ Data-stream-based global event monitoring using pairwise interactions
Cites Work
- Unnamed Item
- Evaluations of domino-free communication-induced checkpointing protocols
- A framework for viewing atomic events in distributed computations
- Consistent records in asynchronous computations
- Checkpointing and Rollback-Recovery for Distributed Systems
- State Restoration in Systems of Communicating Processes
- Time, clocks, and the ordering of events in a distributed system
- Communication-based prevention of useless checkpoints in distributed computations
This page was built for publication: Interval consistency of asynchronous distributed computations