Dynamo
From MaRDI portal
Software:39211
swMATH27495MaRDI QIDQ39211FDOQ39211
Author name not available (Why is that?)
Cited In (17)
- Quantile Markov Decision Processes
- Maximum weight matching with hysteresis in overloaded queues with setups
- Title not available (Why is that?)
- The weakest failure detector for eventual consistency
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Improved time bounds for linearizable implementations of abstract data types
- Generalized Paxos made Byzantine (and less complex)
- Scalable eventually consistent counters over unreliable networks
- Merging ring-structured overlay indices: toward network-data transparency
- A datalog-based computational model for coordination-free, data-parallel systems
- Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
- Computing \(k\)-atomicity in polynomial time
- Multiparty testing preorders
- Simple multi-party set reconciliation
- Enabling compressed encryption for cloud based big data stores
- Non-uniform replication
- Hardening Cassandra against Byzantine failures
This page was built for software: Dynamo
