dscale 0.4.0

A fast & deterministic simulation framework for testing and benchmarking distributed systems
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

use std::sync::Arc;

use rustc_hash::FxHashMap;

use crate::{Rank, random::Distributions};

pub(crate) type LatencyTopology = Vec<Vec<Option<Distributions>>>;
pub(crate) type PoolListing = FxHashMap<String, Vec<Rank>>;

/// Name of the implicit pool that contains every process.
pub const GLOBAL_POOL: &str = "global_pool";

#[derive(Debug)]
pub(crate) struct Topology {
    pool_listing: PoolListing,
    latency_topology: LatencyTopology,
}

impl Topology {
    pub(crate) fn new_arc(
        pool_listing: PoolListing,
        latency_topology: LatencyTopology,
    ) -> Arc<Self> {
        Arc::new(Self {
            pool_listing,
            latency_topology,
        })
    }

    pub(crate) fn get_distribution(&self, from: Rank, to: Rank) -> Distributions {
        self.latency_topology[from][to].expect("No distr found")
    }

    pub(crate) fn list_pool(&self, pool_name: &str) -> &[usize] {
        self.pool_listing.get(pool_name).expect("Invalid pool name")
    }
}