The inhibition spectrum and the achievement of causal consistency

DOI10.1007/S004460050021zbMath1448.68087OpenAlexW2152188445MaRDI QIDQ5137324

Carol Critchlow, Kim Taylor

Publication date: 2 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6941

zbMATH Keywords

impossibility resultglobal statetermination detectionlocal actiondelay event

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (2)

Trade-offs in true concurrency: Pomsets and mazurkiewicz traces ⋮ The power of logical clock abstractions

Uses Software

• Linda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Receptive process theory
• How processes learn
• Distributed deadlock detection
• On distributed snapshots
• Concurrent common knowledge: Defining agreement for asynchronous systems
• Checkpointing and Rollback-Recovery for Distributed Systems
• Distributed Termination
• Time, clocks, and the ordering of events in a distributed system
• Generative communication in Linda

This page was built for publication: The inhibition spectrum and the achievement of causal consistency