|
| 1 | +use criterion::{BenchmarkId, Criterion, criterion_group, criterion_main}; |
| 2 | +#[cfg(feature = "orx-parallel")] |
| 3 | +use orx_parallel::ParIter; |
| 4 | +use orx_tree::*; |
| 5 | +use rayon::iter::{ParallelBridge, ParallelIterator}; |
| 6 | + |
| 7 | +fn build_tree(n: usize) -> DynTree<String> { |
| 8 | + let mut tree = DynTree::new(0.to_string()); |
| 9 | + let mut dfs = Traversal.dfs().over_nodes(); |
| 10 | + while tree.len() < n { |
| 11 | + let root = tree.root(); |
| 12 | + let x: Vec<_> = root.leaves_with(&mut dfs).map(|x| x.idx()).collect(); |
| 13 | + for idx in x.iter() { |
| 14 | + let count = tree.len(); |
| 15 | + let mut node = tree.node_mut(idx); |
| 16 | + let num_children = 20; |
| 17 | + for j in 0..num_children { |
| 18 | + node.push_child((count + j).to_string()); |
| 19 | + } |
| 20 | + } |
| 21 | + } |
| 22 | + tree |
| 23 | +} |
| 24 | + |
| 25 | +fn fibonacci(n: i64) -> i64 { |
| 26 | + let mut a = 0; |
| 27 | + let mut b = 1; |
| 28 | + for _ in 0..n { |
| 29 | + let c = a + b; |
| 30 | + a = b; |
| 31 | + b = c; |
| 32 | + } |
| 33 | + a |
| 34 | +} |
| 35 | + |
| 36 | +fn tree_into_iter(tree: DynTree<String>) -> i64 { |
| 37 | + tree.into_iter() |
| 38 | + .map(|x| x.parse::<usize>().unwrap()) |
| 39 | + .map(|x| fibonacci(x as i64 % 500)) |
| 40 | + .sum() |
| 41 | +} |
| 42 | + |
| 43 | +fn tree_into_dfs(mut tree: DynTree<String>) -> i64 { |
| 44 | + tree.root_mut() |
| 45 | + .into_walk::<Dfs>() |
| 46 | + .map(|x| x.parse::<usize>().unwrap()) |
| 47 | + .map(|x| fibonacci(x as i64 % 500)) |
| 48 | + .sum() |
| 49 | +} |
| 50 | + |
| 51 | +fn tree_into_bfs(mut tree: DynTree<String>) -> i64 { |
| 52 | + tree.root_mut() |
| 53 | + .into_walk::<Bfs>() |
| 54 | + .map(|x| x.parse::<usize>().unwrap()) |
| 55 | + .map(|x| fibonacci(x as i64 % 500)) |
| 56 | + .sum() |
| 57 | +} |
| 58 | + |
| 59 | +fn tree_into_par_x(tree: DynTree<String>) -> i64 { |
| 60 | + tree.into_par() |
| 61 | + .map(|x| x.parse::<usize>().unwrap()) |
| 62 | + .map(|x| fibonacci(x as i64 % 500)) |
| 63 | + .sum() |
| 64 | +} |
| 65 | + |
| 66 | +fn tree_into_iter_rayon(tree: DynTree<String>) -> i64 { |
| 67 | + tree.into_iter() |
| 68 | + .par_bridge() |
| 69 | + .map(|x| x.parse::<usize>().unwrap()) |
| 70 | + .map(|x| fibonacci(x as i64 % 500)) |
| 71 | + .sum() |
| 72 | +} |
| 73 | + |
| 74 | +fn bench(c: &mut Criterion) { |
| 75 | + let treatments = vec![1_024 * 64]; |
| 76 | + |
| 77 | + let mut group = c.benchmark_group("parallelization_owned"); |
| 78 | + |
| 79 | + for n in &treatments { |
| 80 | + let data = build_tree(*n); |
| 81 | + |
| 82 | + let expected = tree_into_iter(data.clone()); |
| 83 | + |
| 84 | + group.bench_with_input(BenchmarkId::new("Tree::into_iter()", n), n, |b, _| { |
| 85 | + let result = tree_into_iter(data.clone()); |
| 86 | + assert_eq!(result, expected); |
| 87 | + b.iter(|| tree_into_iter(data.clone())) |
| 88 | + }); |
| 89 | + |
| 90 | + group.bench_with_input( |
| 91 | + BenchmarkId::new("Tree::root().into_walk::<Dfs>()", n), |
| 92 | + n, |
| 93 | + |b, _| { |
| 94 | + let result = tree_into_dfs(data.clone()); |
| 95 | + assert_eq!(result, expected); |
| 96 | + b.iter(|| tree_into_dfs(data.clone())) |
| 97 | + }, |
| 98 | + ); |
| 99 | + |
| 100 | + group.bench_with_input( |
| 101 | + BenchmarkId::new("Tree::root().into_walk::<Bfs>()", n), |
| 102 | + n, |
| 103 | + |b, _| { |
| 104 | + let result = tree_into_bfs(data.clone()); |
| 105 | + assert_eq!(result, expected); |
| 106 | + b.iter(|| tree_into_bfs(data.clone())) |
| 107 | + }, |
| 108 | + ); |
| 109 | + |
| 110 | + group.bench_with_input( |
| 111 | + BenchmarkId::new("Tree::into_par_x() - orx-parallel", n), |
| 112 | + n, |
| 113 | + |b, _| { |
| 114 | + let result = tree_into_par_x(data.clone()); |
| 115 | + assert_eq!(result, expected); |
| 116 | + b.iter(|| tree_into_par_x(data.clone())) |
| 117 | + }, |
| 118 | + ); |
| 119 | + |
| 120 | + group.bench_with_input( |
| 121 | + BenchmarkId::new("Tree::into_iter().par_bridge() - rayon", n), |
| 122 | + n, |
| 123 | + |b, _| { |
| 124 | + let result = tree_into_iter_rayon(data.clone()); |
| 125 | + assert_eq!(result, expected); |
| 126 | + b.iter(|| tree_into_iter_rayon(data.clone())) |
| 127 | + }, |
| 128 | + ); |
| 129 | + } |
| 130 | + |
| 131 | + group.finish(); |
| 132 | +} |
| 133 | + |
| 134 | +criterion_group!(benches, bench); |
| 135 | +criterion_main!(benches); |
0 commit comments