Strong stable properties in distributed systems
From MaRDI portal
Recommendations
Cites work
- A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
- An efficient reference counting solution to the distributed garbage collection problem
- Distributed deadlock detection
- On distributed snapshots
- Termination detection for diffusing computations
- The derivation of graph marking algorithms from distributed termination detection protocols
- Time, clocks, and the ordering of events in a distributed system
Cited in
(8)- A framework for viewing atomic events in distributed computations
- A class of absolutely stable distributed systems
- Stability of dynamic groups in distributed computing systems
- scientific article; zbMATH DE number 3926228 (Why is no real title available?)
- scientific article; zbMATH DE number 3956427 (Why is no real title available?)
- Efficient detection of a class of stable properties
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Efficient detection of a locally stable predicate in a distributed system
This page was built for publication: Strong stable properties in distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136983)