An example of stepwise refinement of distributed programs: quiescence detection
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Information Processing Letters
Distributed depth-first search and deadlock detection
Distributed depth-first search and deadlock detection
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Using Consistent Subcuts for Detecting Stable Properties
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On the Complexity of the Minimum and Maximum Global Snapshot Problems
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
An efficient minimum and maximum global snapshot algorithm
Information Processing Letters
Detection of global predicates: techniques and their limitations
Distributed Computing
| Hi-index | 0.00 |
A distributed protocol that records bounded snapshots of FIFO and non-FIFO communication channels, thus avoiding the unbounded storage requirements of other global-snapshot protocols, is described. The assumptions and definitions underlying the protocol are discussed, and its correctness is demonstrated. A modified protocol that can minimize a recorded global state by solving the maximum-flow problem is also presented.