svod-runtime 0.1.0-alpha.3

Kernel execution runtime for the Svod ML compiler
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132

use super::*;

#[test]
fn test_sync_strategy() {
    assert_eq!(UnifiedExecutor::sync_strategy(&DeviceSpec::Cpu, &DeviceSpec::Cpu), SyncStrategy::None);

    assert_eq!(
        UnifiedExecutor::sync_strategy(&DeviceSpec::Cuda { device_id: 0 }, &DeviceSpec::Cuda { device_id: 1 }),
        SyncStrategy::PeerToPeer
    );

    assert_eq!(
        UnifiedExecutor::sync_strategy(&DeviceSpec::Cpu, &DeviceSpec::Cuda { device_id: 0 }),
        SyncStrategy::CpuMediated
    );
}

#[test]
fn test_executor_creation() {
    let registry = svod_device::registry::registry();
    let executor = UnifiedExecutor::new(registry);
    assert!(executor.contexts.is_empty());
}

#[test]
fn test_execution_graph_empty() {
    let mut graph = ExecutionGraph::new();
    let groups = graph.compute_parallel_groups();
    assert!(groups.is_empty());
    assert!(graph.is_valid());
}

#[test]
fn test_execution_graph_single_node() {
    let mut graph = ExecutionGraph::new();
    graph.add_node(ExecutionNode {
        id: 1,
        device: DeviceSpec::Cpu,
        inputs: vec![],
        outputs: vec![BufferId(100)],
        predecessors: vec![],
        is_transfer: false,
        buffer_access: None,
    });

    let groups = graph.compute_parallel_groups();
    assert_eq!(groups.len(), 1);
    assert_eq!(groups[0], vec![1]);
    assert!(graph.is_valid());
}

#[test]
fn test_execution_graph_linear_chain() {
    let mut graph = ExecutionGraph::new();

    // A → B → C (linear dependency)
    graph.add_node(ExecutionNode {
        id: 1,
        device: DeviceSpec::Cpu,
        inputs: vec![],
        outputs: vec![BufferId(100)],
        predecessors: vec![],
        is_transfer: false,
        buffer_access: None,
    });
    graph.add_node(ExecutionNode {
        id: 2,
        device: DeviceSpec::Cpu,
        inputs: vec![BufferId(100)],
        outputs: vec![BufferId(101)],
        predecessors: vec![1],
        is_transfer: false,
        buffer_access: None,
    });
    graph.add_node(ExecutionNode {
        id: 3,
        device: DeviceSpec::Cpu,
        inputs: vec![BufferId(101)],
        outputs: vec![BufferId(102)],
        predecessors: vec![2],
        is_transfer: false,
        buffer_access: None,
    });

    let groups = graph.compute_parallel_groups();
    assert_eq!(groups.len(), 3); // Each node in its own group (no parallelism)
    assert!(graph.is_valid());
}

#[test]
fn test_execution_graph_parallel_nodes() {
    let mut graph = ExecutionGraph::new();

    // A and B are independent, both feed into C
    //   A ──┐
    //       └──→ C
    //   B ──┘
    graph.add_node(ExecutionNode {
        id: 1,
        device: DeviceSpec::Cpu,
        inputs: vec![],
        outputs: vec![BufferId(100)],
        predecessors: vec![],
        is_transfer: false,
        buffer_access: None,
    });
    graph.add_node(ExecutionNode {
        id: 2,
        device: DeviceSpec::Cpu,
        inputs: vec![],
        outputs: vec![BufferId(101)],
        predecessors: vec![],
        is_transfer: false,
        buffer_access: None,
    });
    graph.add_node(ExecutionNode {
        id: 3,
        device: DeviceSpec::Cpu,
        inputs: vec![BufferId(100), BufferId(101)],
        outputs: vec![BufferId(102)],
        predecessors: vec![1, 2],
        is_transfer: false,
        buffer_access: None,
    });

    let groups = graph.compute_parallel_groups();
    assert_eq!(groups.len(), 2); // First group has A,B; second has C
    assert!(groups[0].contains(&1));
    assert!(groups[0].contains(&2));
    assert_eq!(groups[1], vec![3]);
    assert!(graph.is_valid());
}