Flush primitives for asynchronous distributed systems

DOI10.1016/0020-0190(90)90222-JzbMath0695.68018MaRDI QIDQ910192

Mohan L. Ahuja

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

verificationdistributed systemsprogramming languagesconcurrencysynchronisationasynchronous networksF-channelsFIFO channelsglobal snapshots

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Related Items (5)

An optimal algorithm for distributed snapshots with causal message ordering ⋮ Implementation of hierarchical F-channels for high-performance distributed computing ⋮ Synchronous, asynchronous, and causally ordered communication ⋮ Deriving global virtual time algorithms from conservative simulation protocols ⋮ Recording distributed snapshots based on causal order of message delivery

Cites Work

• How processes learn
• On distributed snapshots
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Flush primitives for asynchronous distributed systems