Enum AllReduceAlgorithm 

pub enum AllReduceAlgorithm {
    Ring,
    Tree,
    RecursiveHalving,
    Auto,
}

Algorithm selection for AllReduce.

Variants

Ring

Ring-based — bandwidth-optimal for large messages.

Tree

Tree-based — latency-optimal for small messages.

RecursiveHalving

Recursive halving-doubling — for power-of-2 rank counts.

Auto

Automatic selection based on message size and rank count.

Trait Implementations

impl Clone for AllReduceAlgorithm

fn clone(&self) -> AllReduceAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AllReduceAlgorithm

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

Formats the value using the given formatter.

impl Hash for AllReduceAlgorithm

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for AllReduceAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for AllReduceAlgorithm

impl Eq for AllReduceAlgorithm

impl StructuralPartialEq for AllReduceAlgorithm