Pages that link to "Item:Q5136986"
From MaRDI portal
The following pages link to Atomic snapshots using lattice agreement (Q5136986):
Displaying 16 items.
- The time complexity of updating snapshot memories (Q293175) (← links)
- Help when needed, but no more: efficient read/write partial snapshot (Q663424) (← links)
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (Q1822234) (← links)
- Asynchronous reconfiguration with Byzantine failures (Q2104034) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (Q2672251) (← links)
- (Q5090934) (← links)
- An adaptive collect algorithm with applications (Q5138374) (← links)
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract) (Q5176772) (← links)
- Split and migrate: Resource-driven placement and discovery of microservices at the edge (Q5874263) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)
- k-Immediate Snapshot and x-Set Agreement: How Are They Related? (Q6487899) (← links)
- Asynchronous reconfiguration with Byzantine failures (Q6535026) (← links)
- Byzantine lattice agreement in synchronous message passing systems (Q6535031) (← links)
