Struct RingBackend 

pub struct RingBackend { /* private fields */ }

Implementations

impl RingBackend

pub async fn new(config: DistributedConfig) -> Result<Self>

Trait Implementations

impl DistributedBackend for RingBackend

fn barrier<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Two-phase barrier using a monotonic sequence number.

Phase 1 (propagate): send the barrier token with a unique sequence number around the ring; each node forwards it after receiving from its predecessor. When the token reaches the initiator after world_size - 1 hops, every node has observed it.

Phase 2 (acknowledge): send the sequence number back around the ring in the same direction to signal completion. When a node receives the acknowledgement it knows all nodes have finished Phase 1 and may proceed.

The monotonic counter prevents tokens from a crashed/slow previous round from being mistaken for tokens from the current round.

fn rank(&self) -> usize

Get the rank of this node (0 to world_size - 1).

fn world_size(&self) -> usize

Get the total number of nodes.

fn all_reduce<'life0, 'life1, 'async_trait>( &'life0 self, buffer: &'life1 mut [u8], op: ReduceOp, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Perform an all-reduce operation on a buffer.