Shared global states in distributed computations

DOI10.1006/JCSS.1997.1512zbMath0897.68044OpenAlexW2050371948MaRDI QIDQ1384536

Eddy Fromentin, Michel Raynal

Publication date: 4 August 1998

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1512

zbMATH Keywords

distributed computationshared global states

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION ⋮ On the no-Z-cycle property in distributed executions

Cites Work

• Unnamed Item
• Unnamed Item
• Some optimal algorithms for decomposed partially ordered sets
• Consistent global checkpoints based on direct dependency tracking
• Detecting causal relationships in distributed computations: In search of the holy grail
• Time, clocks, and the ordering of events in a distributed system
• Adding Time to Synchronous Process Communications
• Reachability analysis on distributed executions
• Efficient detection of a class of stable properties

This page was built for publication: Shared global states in distributed computations