2021-11-25 23:36:17 +01:00
|
|
|
use executor::blocking;
|
2022-05-05 15:50:44 +02:00
|
|
|
use executor::prelude::ProcStack;
|
2021-11-25 23:36:17 +01:00
|
|
|
use executor::run::run;
|
|
|
|
use futures_util::future::join_all;
|
2021-11-14 17:51:48 +01:00
|
|
|
use lightproc::recoverable_handle::RecoverableHandle;
|
|
|
|
use std::thread;
|
|
|
|
use std::time::Duration;
|
|
|
|
use std::time::Instant;
|
|
|
|
|
|
|
|
// Test for slow joins without task bursts during joins.
|
|
|
|
#[test]
|
|
|
|
#[ignore]
|
|
|
|
fn slow_join() {
|
|
|
|
let thread_join_time_max = 11_000;
|
|
|
|
let start = Instant::now();
|
|
|
|
|
|
|
|
// Send an initial batch of million bursts.
|
|
|
|
let handles = (0..1_000_000)
|
|
|
|
.map(|_| {
|
2022-05-05 15:50:44 +02:00
|
|
|
blocking::spawn_blocking(async {
|
|
|
|
let duration = Duration::from_millis(1);
|
|
|
|
thread::sleep(duration);
|
|
|
|
})
|
2021-11-14 17:51:48 +01:00
|
|
|
})
|
|
|
|
.collect::<Vec<RecoverableHandle<()>>>();
|
|
|
|
|
2021-11-25 23:36:17 +01:00
|
|
|
run(join_all(handles), ProcStack {});
|
2021-11-14 17:51:48 +01:00
|
|
|
|
|
|
|
// Let them join to see how it behaves under different workloads.
|
|
|
|
let duration = Duration::from_millis(thread_join_time_max);
|
|
|
|
thread::sleep(duration);
|
|
|
|
|
|
|
|
// Spawn yet another batch of work on top of it
|
|
|
|
let handles = (0..10_000)
|
|
|
|
.map(|_| {
|
2022-05-05 15:50:44 +02:00
|
|
|
blocking::spawn_blocking(async {
|
|
|
|
let duration = Duration::from_millis(100);
|
|
|
|
thread::sleep(duration);
|
|
|
|
})
|
2021-11-14 17:51:48 +01:00
|
|
|
})
|
|
|
|
.collect::<Vec<RecoverableHandle<()>>>();
|
|
|
|
|
2021-11-25 23:36:17 +01:00
|
|
|
run(join_all(handles), ProcStack {});
|
2021-11-14 17:51:48 +01:00
|
|
|
|
|
|
|
// Slow joins shouldn't cause internal slow down
|
|
|
|
let elapsed = start.elapsed().as_millis() - thread_join_time_max as u128;
|
|
|
|
println!("Slow task join. Monotonic exec time: {:?} ns", elapsed);
|
|
|
|
|
|
|
|
// Previous implementation is around this threshold.
|
|
|
|
}
|
|
|
|
|
|
|
|
// Test for slow joins with task burst.
|
|
|
|
#[test]
|
|
|
|
#[ignore]
|
|
|
|
fn slow_join_interrupted() {
|
|
|
|
let thread_join_time_max = 2_000;
|
|
|
|
let start = Instant::now();
|
|
|
|
|
|
|
|
// Send an initial batch of million bursts.
|
|
|
|
let handles = (0..1_000_000)
|
|
|
|
.map(|_| {
|
2022-05-05 15:50:44 +02:00
|
|
|
blocking::spawn_blocking(async {
|
|
|
|
let duration = Duration::from_millis(1);
|
|
|
|
thread::sleep(duration);
|
|
|
|
})
|
2021-11-14 17:51:48 +01:00
|
|
|
})
|
|
|
|
.collect::<Vec<RecoverableHandle<()>>>();
|
|
|
|
|
2021-11-25 23:36:17 +01:00
|
|
|
run(join_all(handles), ProcStack {});
|
2021-11-14 17:51:48 +01:00
|
|
|
|
|
|
|
// Let them join to see how it behaves under different workloads.
|
|
|
|
// This time join under the time window.
|
|
|
|
let duration = Duration::from_millis(thread_join_time_max);
|
|
|
|
thread::sleep(duration);
|
|
|
|
|
|
|
|
// Spawn yet another batch of work on top of it
|
|
|
|
let handles = (0..10_000)
|
|
|
|
.map(|_| {
|
2022-05-05 15:50:44 +02:00
|
|
|
blocking::spawn_blocking(async {
|
|
|
|
let duration = Duration::from_millis(100);
|
|
|
|
thread::sleep(duration);
|
|
|
|
})
|
2021-11-14 17:51:48 +01:00
|
|
|
})
|
|
|
|
.collect::<Vec<RecoverableHandle<()>>>();
|
|
|
|
|
2021-11-25 23:36:17 +01:00
|
|
|
run(join_all(handles), ProcStack {});
|
2021-11-14 17:51:48 +01:00
|
|
|
|
|
|
|
// Slow joins shouldn't cause internal slow down
|
|
|
|
let elapsed = start.elapsed().as_millis() - thread_join_time_max as u128;
|
|
|
|
println!("Slow task join. Monotonic exec time: {:?} ns", elapsed);
|
|
|
|
|
|
|
|
// Previous implementation is around this threshold.
|
|
|
|
}
|
|
|
|
|
|
|
|
// This test is expensive but it proves that longhauling tasks are working in adaptive thread pool.
|
|
|
|
// Thread pool which spawns on-demand will panic with this test.
|
|
|
|
#[test]
|
|
|
|
#[ignore]
|
|
|
|
fn longhauling_task_join() {
|
|
|
|
let thread_join_time_max = 11_000;
|
|
|
|
let start = Instant::now();
|
|
|
|
|
|
|
|
// First batch of overhauling tasks
|
|
|
|
let _ = (0..100_000)
|
|
|
|
.map(|_| {
|
2022-05-05 15:50:44 +02:00
|
|
|
blocking::spawn_blocking(async {
|
|
|
|
let duration = Duration::from_millis(1000);
|
|
|
|
thread::sleep(duration);
|
|
|
|
})
|
2021-11-14 17:51:48 +01:00
|
|
|
})
|
|
|
|
.collect::<Vec<RecoverableHandle<()>>>();
|
|
|
|
|
|
|
|
// Let them join to see how it behaves under different workloads.
|
|
|
|
let duration = Duration::from_millis(thread_join_time_max);
|
|
|
|
thread::sleep(duration);
|
|
|
|
|
|
|
|
// Send yet another medium sized batch to see how it scales.
|
|
|
|
let handles = (0..10_000)
|
|
|
|
.map(|_| {
|
2022-05-05 15:50:44 +02:00
|
|
|
blocking::spawn_blocking(async {
|
|
|
|
let duration = Duration::from_millis(100);
|
|
|
|
thread::sleep(duration);
|
|
|
|
})
|
2021-11-14 17:51:48 +01:00
|
|
|
})
|
|
|
|
.collect::<Vec<RecoverableHandle<()>>>();
|
|
|
|
|
2021-11-25 23:36:17 +01:00
|
|
|
run(join_all(handles), ProcStack {});
|
2021-11-14 17:51:48 +01:00
|
|
|
|
|
|
|
// Slow joins shouldn't cause internal slow down
|
|
|
|
let elapsed = start.elapsed().as_millis() - thread_join_time_max as u128;
|
|
|
|
println!(
|
|
|
|
"Long-hauling task join. Monotonic exec time: {:?} ns",
|
|
|
|
elapsed
|
|
|
|
);
|
|
|
|
|
|
|
|
// Previous implementation will panic when this test is running.
|
|
|
|
}
|