rain_server 0.4.0

Distributed computational framework for large-scale task-based pipelines. Server and governor binaries.
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

use rain_core::{types::*, utils::*};
use std::collections::HashMap;

use super::{DataObjectRef, ExecutorRef, TaskRef};
use governor::tasks::TaskInstance;

pub struct Graph {
    pub ready_tasks: Vec<TaskRef>,
    pub running_tasks: HashMap<TaskId, TaskInstance>,
    pub tasks: HashMap<TaskId, TaskRef>,
    pub objects: HashMap<DataObjectId, DataObjectRef>,
    pub executors: HashMap<ExecutorId, ExecutorRef>,
    pub idle_executors: RcSet<ExecutorRef>,

    /// List of unsued objects, the value is time when it should be freed
    /// This is list is periodically checked
    pub delete_wait_list: HashMap<DataObjectRef, ::std::time::Instant>,

    /// Last assigned id
    id_counter: Id,
}

impl Graph {
    pub fn new() -> Self {
        Self {
            ready_tasks: Vec::new(),
            running_tasks: HashMap::new(),
            tasks: HashMap::new(),
            objects: HashMap::new(),
            executors: HashMap::new(),
            idle_executors: Default::default(),
            delete_wait_list: Default::default(),
            id_counter: 0,
        }
    }

    pub fn make_id(&mut self) -> Id {
        self.id_counter += 1;
        self.id_counter
    }
}