garage/src/table/replication/sharded.rs

54 lines
1.5 KiB
Rust
Raw Normal View History

2021-03-16 10:14:27 +00:00
use std::sync::Arc;
2021-03-16 11:18:03 +00:00
use garage_rpc::ring::*;
2021-10-14 09:50:12 +00:00
use garage_rpc::system::System;
2020-04-24 10:10:01 +00:00
use garage_util::data::*;
2021-03-11 15:54:15 +00:00
use crate::replication::*;
2021-03-26 18:41:46 +00:00
/// Sharded replication schema:
/// - based on the ring of nodes, a certain set of neighbors
/// store entries, given as a function of the position of the
/// entry's hash in the ring
/// - reads are done on all of the nodes that replicate the data
/// - writes as well
#[derive(Clone)]
pub struct TableShardedReplication {
2021-03-26 18:41:46 +00:00
/// The membership manager of this node
2021-03-16 10:14:27 +00:00
pub system: Arc<System>,
2021-03-26 18:41:46 +00:00
/// How many time each data should be replicated
pub replication_factor: usize,
2021-03-26 18:41:46 +00:00
/// How many nodes to contact for a read, should be at most `replication_factor`
pub read_quorum: usize,
2021-03-26 18:41:46 +00:00
/// How many nodes to contact for a write, should be at most `replication_factor`
pub write_quorum: usize,
}
impl TableReplication for TableShardedReplication {
fn read_nodes(&self, hash: &Hash) -> Vec<Uuid> {
let ring = self.system.ring.borrow();
ring.get_nodes(&hash, self.replication_factor)
}
fn read_quorum(&self) -> usize {
self.read_quorum
}
fn write_nodes(&self, hash: &Hash) -> Vec<Uuid> {
2021-03-16 10:14:27 +00:00
let ring = self.system.ring.borrow();
ring.get_nodes(&hash, self.replication_factor)
}
2021-03-16 10:14:27 +00:00
fn write_quorum(&self) -> usize {
self.write_quorum
}
fn max_write_errors(&self) -> usize {
self.replication_factor - self.write_quorum
}
2021-03-16 11:18:03 +00:00
fn partition_of(&self, hash: &Hash) -> Partition {
self.system.ring.borrow().partition_of(hash)
}
fn partitions(&self) -> Vec<(Partition, Hash)> {
self.system.ring.borrow().partitions()
}
}