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
|
//! Benchmarks for `ProcessExecutor::execute_async`.
use criterion::BatchSize;
use criterion::BenchmarkId;
use criterion::Criterion;
use criterion::Throughput;
use criterion::criterion_group;
use criterion::criterion_main;
use shirabe::util::process_executor::ProcessExecutor;
/// Pinned so the measurement does not depend on `COMPOSER_MAX_PARALLEL_PROCESSES`, which
/// `ProcessExecutor::new` otherwise reads to size the semaphore.
const MAX_JOBS: i64 = 10;
/// The cheapest child that still goes through the whole spawn path.
const COMMAND: &[&str; 1] = &["true"];
/// `execute_async`'s futures are `!Send` (the io handle is an `Rc`), so they are driven by
/// `block_on` on a current-thread runtime rather than spawned onto a worker pool. Concurrency
/// within a case therefore comes from joining futures inside the single task.
fn runtime() -> tokio::runtime::Runtime {
tokio::runtime::Builder::new_current_thread()
.enable_all()
.build()
.expect("failed to build the benchmark runtime")
}
fn executor() -> ProcessExecutor {
let mut process_executor = ProcessExecutor::new(None);
process_executor.enable_async();
process_executor.set_max_jobs(MAX_JOBS);
process_executor
}
fn bench_single(c: &mut Criterion) {
let runtime = runtime();
let mut group = c.benchmark_group("execute_async/single");
group.bench_function("argv", |b| {
b.to_async(&runtime).iter_batched(
executor,
|mut process_executor| async move {
let process = process_executor.execute_async(COMMAND, None);
process.await.expect("the child failed to run")
},
BatchSize::SmallInput,
);
});
group.bench_function("shell", |b| {
b.to_async(&runtime).iter_batched(
executor,
|mut process_executor| async move {
let process = process_executor.execute_async("true", None);
process.await.expect("the child failed to run")
},
BatchSize::SmallInput,
);
});
group.finish();
}
fn bench_concurrent(c: &mut Criterion) {
let runtime = runtime();
let mut group = c.benchmark_group("execute_async/concurrent");
for jobs in [1_u64, MAX_JOBS as u64, MAX_JOBS as u64 * 2] {
group.throughput(Throughput::Elements(jobs));
group.bench_with_input(BenchmarkId::from_parameter(jobs), &jobs, |b, &jobs| {
b.to_async(&runtime).iter_batched(
executor,
|mut process_executor| async move {
let processes: Vec<_> = (0..jobs)
.map(|_| process_executor.execute_async(COMMAND, None))
.collect();
futures::future::join_all(processes)
.await
.into_iter()
.map(|process| process.expect("the child failed to run"))
.collect::<Vec<_>>()
},
BatchSize::SmallInput,
);
});
}
group.finish();
}
criterion_group!(benches, bench_single, bench_concurrent);
criterion_main!(benches);
|
