Enum AggregationStrategy 

pub enum AggregationStrategy {
    BinaryTree,
    Ring,
    Butterfly,
    Adaptive,
}

Hierarchical aggregation strategies for distributed training

This module provides advanced hierarchical aggregation algorithms that optimize communication patterns for different network topologies and cluster configurations. It supports tree-based, ring-based, and butterfly aggregation patterns.

Variants

BinaryTree

Binary tree aggregation (optimal for small clusters)

Ring

Ring-based aggregation (bandwidth-optimal)

Butterfly

Butterfly aggregation (latency-optimal)

Adaptive

Adaptive strategy that selects best algorithm based on cluster topology

Trait Implementations

impl Clone for AggregationStrategy

fn clone(&self) -> AggregationStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AggregationStrategy

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

Formats the value using the given formatter.

impl Hash for AggregationStrategy

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 AggregationStrategy

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

impl Eq for AggregationStrategy

impl StructuralPartialEq for AggregationStrategy