ppl 0.1.6

A structured parallel programming library for Rust.
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

/**
    Matrix * Vector multiplication
    A: n*n matrix
    b: n vector
*/
use ppl::prelude::*;
use rand::Rng;

// Taken a matrix, this source emit a row of the matrix at a time.
struct Source {
    matrix: Vec<Vec<i64>>,
}
impl Out<Vec<i64>> for Source {
    fn run(&mut self) -> Option<Vec<i64>> {
        if !self.matrix.is_empty() {
            return Some(self.matrix.remove(0));
        }
        None
    }
}

// Given a vector, this stage multiply it by the vector stored in its state.
#[derive(Clone)]
struct Multiplication {
    vec: Vec<i64>,
}
impl InOut<Vec<i64>, i64> for Multiplication {
    fn run(&mut self, input: Vec<i64>) -> Option<i64> {
        Some(mult(input, &self.vec))
    }
    // This stage is ordered because the multiplication is done in order.
    fn is_ordered(&self) -> bool {
        true
    }
    fn number_of_replicas(&self) -> usize {
        6
    }
}

// This sink collect the results of the multiplication.
// It is possible to use an OrderedSinkVec instead of this custom sink.
struct Sink {
    res: Vec<i64>,
}
impl In<i64, Vec<i64>> for Sink {
    fn run(&mut self, input: i64) {
        self.res.push(input);
    }
    fn is_ordered(&self) -> bool {
        true
    }
    fn finalize(self) -> Option<Vec<i64>> {
        Some(self.res)
    }
}

fn mult(m: Vec<i64>, v: &[i64]) -> i64 {
    let mut res = 0;
    for i in 0..m.len() {
        res += m[i] * v[i];
    }
    res
}

#[test]
fn test_mxv() {
    env_logger::init();

    let n = 1000; //rows
    let mut matrix = vec![vec![0; n]; n];
    let mut vec = vec![0; n];
    let mut correct_result = vec![0; n];

    for i in 0..n {
        vec[i] = rand::thread_rng().gen_range(0..10);
        for j in 0..n {
            matrix[i][j] = rand::thread_rng().gen_range(0..10);
        }
    }

    // Build and start the spp graph
    let mut p = pipeline![
        Source {
            matrix: matrix.clone()
        },
        Multiplication { vec: vec.clone() },
        Sink { res: vec![] }
    ];

    p.start();

    // Collect the results of the computation
    let res = p.wait_end().unwrap();

    // Compute the "reference" result
    for i in 0..matrix.len() {
        (0..vec.len()).for_each(|j| {
            correct_result[i] += matrix[i][j] * vec[j];
        });
    }

    assert_eq!(res, correct_result);
}