Enum AllReduceStrategy 

pub enum AllReduceStrategy {
    Ring,
    Tree {
        arity: usize,
    },
    Centralized,
    Auto,
}

All-reduce algorithm strategy.

Variants

Ring

Ring all-reduce: O(n) latency, O(1) bandwidth per node. Best for large tensors on high-bandwidth networks.

Tree

Tree all-reduce: O(log n) latency, O(log n) bandwidth per node. Best for small tensors or latency-sensitive operations.

Fields

arity: usize

Centralized

Centralized all-reduce: O(n) latency, O(n) bandwidth on root. Simple, works for small collectives.

Auto

Automatic selection based on tensor size and cluster topology.

Trait Implementations

impl Clone for AllReduceStrategy

fn clone(&self) -> AllReduceStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AllReduceStrategy

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

Formats the value using the given formatter.

impl Default for AllReduceStrategy

fn default() -> AllReduceStrategy

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for AllReduceStrategy

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for AllReduceStrategy

fn eq(&self, other: &AllReduceStrategy) -> 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 Serialize for AllReduceStrategy

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for AllReduceStrategy

impl Eq for AllReduceStrategy

impl StructuralPartialEq for AllReduceStrategy