Skip to main content

ShuffleSharding

Struct ShuffleSharding 

Source
pub struct ShuffleSharding {
    pub percent: u32,
    pub min_backends: u32,
    pub mode: ShardMode,
}
Expand description

A cluster’s shuffle-sharding policy (sozu-proxy/sozu#524).

Shuffle sharding (Colm MacCárthaigh, Workload isolation using shuffle sharding, Amazon Builders’ Library, 2019) gives each client a shard: a small subset of the cluster’s backends, drawn so that two clients rarely share all of theirs. A client that overloads or poisons its shard then takes down only the clients whose shard is entirely inside its own. With N backends in shards of k there are C(N, k) shards, against N / k with plain partitioning: C(8, 2) = 28 against 4.

Here a client’s shard is the top k of the rendezvous (HRW) ranking of its affinity key over the cluster’s primary backends (hrw_score; David Thaler and Chinya Ravishankar, Using name-based mappings to increase hit rates, IEEE/ACM Transactions on Networking, 1998). That makes a shard stable: removing a backend outside a client’s shard leaves the shard unchanged, and adding one can only displace the shard’s lowest-ranked member, so a change of N moves clients only at the tail of their ranking. The cluster’s load-balancing policy then selects inside the shard.

Fields§

§percent: u32

Share of the primary backends in a shard, 1..=100.

§min_backends: u32

Sharding applies only from this many primary backends.

§mode: ShardMode

What an exhausted shard does.

Implementations§

Source§

impl ShuffleSharding

Source

pub fn from_cluster( shard_percent: Option<u32>, shard_min_backends: Option<u32>, shard_mode: Option<i32>, ) -> Option<Self>

The sharding a cluster configures, None when shard_percent is unset. shard_min_backends defaults to DEFAULT_SHARD_MIN_BACKENDS, shard_mode to FALLBACK.

Source

pub fn shard_size(&self, primaries: usize) -> Option<usize>

The shard size k for a cluster of primaries primary backends: max(2, ceil(percent × primaries / 100)), capped at primaries. None below min_backends, where the cluster is not sharded.

Trait Implementations§

Source§

impl Clone for ShuffleSharding

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Copy for ShuffleSharding

Source§

impl Debug for ShuffleSharding

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Eq for ShuffleSharding

Source§

impl PartialEq for ShuffleSharding

Source§

fn eq(&self, other: &Self) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for ShuffleSharding

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

Source§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

Source§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

Source§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.