-
-
Notifications
You must be signed in to change notification settings - Fork 4.2k
Task System for Bevy #384
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Task System for Bevy #384
Changes from 16 commits
0bf6700
fe6cf0d
058e26c
d6cbe59
1a55abe
c76cb5f
cd7ce62
3014032
4b3619f
4232e75
93fcd7d
e406b07
5a59d62
d092add
8996109
224f358
879afa9
77b126d
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,4 @@ | ||
use crate::app_builder::AppBuilder; | ||
use crate::{app_builder::AppBuilder, DefaultTaskPoolOptions}; | ||
use bevy_ecs::{ParallelExecutor, Resources, Schedule, World}; | ||
|
||
#[allow(clippy::needless_doctest_main)] | ||
|
@@ -63,6 +63,12 @@ impl App { | |
} | ||
|
||
pub fn run(mut self) { | ||
// Setup the default bevy task pools | ||
self.resources | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I'm not convinced bevy_tasks should be hard-coded into apps, especially given that we're just adding resources. Can we make this a plugin that we add with There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Making a plugin in bevy_tasks will cause circular dependencies (app depends on ecs, ecs depends on tasks). Where to do you want it to be? |
||
.get_cloned::<DefaultTaskPoolOptions>() | ||
.unwrap_or_else(DefaultTaskPoolOptions::default) | ||
.create_default_pools(&mut self.resources); | ||
|
||
self.startup_schedule.initialize(&mut self.resources); | ||
self.startup_executor.run( | ||
&mut self.startup_schedule, | ||
|
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,147 @@ | ||
use bevy_ecs::Resources; | ||
use bevy_tasks::{AsyncComputeTaskPool, ComputeTaskPool, IOTaskPool, TaskPoolBuilder}; | ||
|
||
/// Defines a simple way to determine how many threads to use given the number of remaining cores | ||
/// and number of total cores | ||
#[derive(Clone)] | ||
pub struct TaskPoolThreadAssignmentPolicy { | ||
/// Force using at least this many threads | ||
pub min_threads: usize, | ||
/// Under no circumstance use more than this many threads for this pool | ||
pub max_threads: usize, | ||
/// Target using this percentage of total cores, clamped by min_threads and max_threads. It is | ||
/// permitted to use 1.0 to try to use all remaining threads | ||
pub percent: f32, | ||
} | ||
|
||
impl TaskPoolThreadAssignmentPolicy { | ||
/// Determine the number of threads to use for this task pool | ||
fn get_number_of_threads(&self, remaining_threads: usize, total_threads: usize) -> usize { | ||
assert!(self.percent >= 0.0); | ||
let mut desired = (total_threads as f32 * self.percent).round() as usize; | ||
|
||
// Limit ourselves to the number of cores available | ||
desired = desired.min(remaining_threads); | ||
|
||
// Clamp by min_threads, max_threads. (This may result in us using more threads than are | ||
// available, this is intended. An example case where this might happen is a device with | ||
// <= 2 threads. | ||
bevy_math::clamp(desired, self.min_threads, self.max_threads) | ||
} | ||
} | ||
|
||
/// Helper for configuring and creating the default task pools. For end-users who want full control, | ||
/// insert the default task pools into the resource map manually. If the pools are already inserted, | ||
/// this helper will do nothing. | ||
#[derive(Clone)] | ||
pub struct DefaultTaskPoolOptions { | ||
/// If the number of physical cores is less than min_total_threads, force using min_total_threads | ||
pub min_total_threads: usize, | ||
/// If the number of physical cores is grater than max_total_threads, force using max_total_threads | ||
pub max_total_threads: usize, | ||
|
||
/// Used to determine number of IO threads to allocate | ||
pub io: TaskPoolThreadAssignmentPolicy, | ||
/// Used to determine number of async compute threads to allocate | ||
pub async_compute: TaskPoolThreadAssignmentPolicy, | ||
/// Used to determine number of compute threads to allocate | ||
pub compute: TaskPoolThreadAssignmentPolicy, | ||
} | ||
|
||
impl Default for DefaultTaskPoolOptions { | ||
fn default() -> Self { | ||
DefaultTaskPoolOptions { | ||
// By default, use however many cores are available on the system | ||
min_total_threads: 1, | ||
max_total_threads: std::usize::MAX, | ||
|
||
// Use 25% of cores for IO, at least 1, no more than 4 | ||
io: TaskPoolThreadAssignmentPolicy { | ||
min_threads: 1, | ||
max_threads: 4, | ||
percent: 0.25, | ||
}, | ||
|
||
// Use 25% of cores for async compute, at least 1, no more than 4 | ||
async_compute: TaskPoolThreadAssignmentPolicy { | ||
min_threads: 1, | ||
max_threads: 4, | ||
percent: 0.25, | ||
}, | ||
|
||
// Use all remaining cores for compute (at least 1) | ||
compute: TaskPoolThreadAssignmentPolicy { | ||
min_threads: 1, | ||
max_threads: std::usize::MAX, | ||
percent: 1.0, // This 1.0 here means "whatever is left over" | ||
}, | ||
} | ||
} | ||
} | ||
|
||
impl DefaultTaskPoolOptions { | ||
/// Create a configuration that forces using the given number of threads. | ||
pub fn with_num_threads(thread_count: usize) -> Self { | ||
let mut options = Self::default(); | ||
options.min_total_threads = thread_count; | ||
options.max_total_threads = thread_count; | ||
|
||
options | ||
} | ||
|
||
/// Inserts the default thread pools into the given resource map based on the configured values | ||
pub fn create_default_pools(&self, resources: &mut Resources) { | ||
let total_threads = bevy_math::clamp( | ||
bevy_tasks::logical_core_count(), | ||
self.min_total_threads, | ||
self.max_total_threads, | ||
); | ||
|
||
let mut remaining_threads = total_threads; | ||
|
||
if !resources.contains::<IOTaskPool>() { | ||
cart marked this conversation as resolved.
Show resolved
Hide resolved
|
||
// Determine the number of IO threads we will use | ||
let io_threads = self | ||
.io | ||
.get_number_of_threads(remaining_threads, total_threads); | ||
remaining_threads -= io_threads; | ||
|
||
resources.insert(IOTaskPool( | ||
TaskPoolBuilder::default() | ||
.num_threads(io_threads) | ||
.thread_name("IO Task Pool".to_string()) | ||
.build(), | ||
)); | ||
} | ||
|
||
if !resources.contains::<AsyncComputeTaskPool>() { | ||
// Determine the number of async compute threads we will use | ||
let async_compute_threads = self | ||
.async_compute | ||
.get_number_of_threads(remaining_threads, total_threads); | ||
remaining_threads -= async_compute_threads; | ||
|
||
resources.insert(AsyncComputeTaskPool( | ||
TaskPoolBuilder::default() | ||
.num_threads(async_compute_threads) | ||
.thread_name("Async Compute Task Pool".to_string()) | ||
.build(), | ||
)); | ||
} | ||
|
||
if !resources.contains::<ComputeTaskPool>() { | ||
// Determine the number of compute threads we will use | ||
// This is intentionally last so that an end user can specify 1.0 as the percent | ||
let compute_threads = self | ||
.compute | ||
.get_number_of_threads(remaining_threads, total_threads); | ||
|
||
resources.insert(ComputeTaskPool( | ||
TaskPoolBuilder::default() | ||
.num_threads(compute_threads) | ||
.thread_name("Compute Task Pool".to_string()) | ||
.build(), | ||
)); | ||
} | ||
} | ||
} |
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
/// A value bounded by a minimum and a maximum | ||
/// | ||
/// If input is less than min then this returns min. | ||
/// If input is greater than max then this returns max. | ||
/// Otherwise this returns input. | ||
/// | ||
/// **Panics** in debug mode if `!(min <= max)`. | ||
/// | ||
/// Original implementation from num-traits licensed as MIT | ||
pub fn clamp<T: PartialOrd>(input: T, min: T, max: T) -> T { | ||
debug_assert!(min <= max, "min must be less than or equal to max"); | ||
if input < min { | ||
min | ||
} else if input > max { | ||
max | ||
} else { | ||
input | ||
} | ||
} |
Uh oh!
There was an error while loading. Please reload this page.