dscale 0.4.1

A fast & deterministic simulation framework for benchmarking and testing 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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67

use std::{cmp::Reverse, collections::BinaryHeap};

use crate::{Jiffies, MessagePtr, Rank, TimerId};

pub(crate) enum Step {
    Start {
        rank: Rank,
    },
    NetworkStep {
        source: Rank,
        target: Rank,
        message: MessagePtr,
    },
    TimerStep {
        rank: Rank,
        id: TimerId,
    },
}

impl Step {
    pub(crate) fn target_rank(&self) -> Rank {
        match self {
            Step::Start { rank } => *rank,
            Step::NetworkStep { target, .. } => *target,
            Step::TimerStep { rank, .. } => *rank,
        }
    }
}

pub(crate) struct TimedStep {
    pub(crate) invocation_time: Jiffies,
    pub(crate) step: Step,
}

impl PartialEq for TimedStep {
    fn eq(&self, other: &Self) -> bool {
        self.invocation_time.eq(&other.invocation_time)
    }
}

impl Eq for TimedStep {}

impl PartialOrd for TimedStep {
    fn ge(&self, other: &Self) -> bool {
        self.invocation_time.ge(&other.invocation_time)
    }
    fn le(&self, other: &Self) -> bool {
        self.invocation_time.le(&other.invocation_time)
    }
    fn gt(&self, other: &Self) -> bool {
        self.invocation_time.gt(&other.invocation_time)
    }
    fn lt(&self, other: &Self) -> bool {
        self.invocation_time.lt(&other.invocation_time)
    }
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        self.invocation_time.partial_cmp(&other.invocation_time)
    }
}

impl Ord for TimedStep {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.invocation_time.cmp(&other.invocation_time)
    }
}

pub(crate) type StepQueue = BinaryHeap<Reverse<TimedStep>>;