Dynamo
From MaRDI portal
Cited in
(36)- EVENODD
- SCRIBE
- Improved time bounds for linearizable implementations of abstract data types
- Scalable eventually consistent counters over unreliable networks
- The weakest failure detector for eventual consistency
- Simple multi-party set reconciliation
- Chord
- Cscope
- BlobSeer
- HBase
- Cassandra
- Pastry
- Generalized Paxos made Byzantine (and less complex)
- MongoDB
- D4M
- Maximum weight matching with hysteresis in overloaded queues with setups
- Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
- Rappel
- Enabling compressed encryption for cloud based big data stores
- Non-uniform replication
- Hardening Cassandra against Byzantine failures
- AsterixDB
- Plutus
- SiRiUS
- Rover
- Bigtable
- CryptDB
- DIADEM
- Merging ring-structured overlay indices: toward network-data transparency
- A datalog-based computational model for coordination-free, data-parallel systems
- Computing k-atomicity in polynomial time
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Round-hashing for data storage: distributed servers and external-memory tables
- Multiparty testing preorders
- Quantile Markov Decision Processes
- Logoot
This page was built for software: Dynamo
