Struct TaskSet 

pub struct TaskSet {
    pub tasks: Vec<Task>,
}

A task set for the static schedulability analysis.

Fields

tasks: Vec<Task>

The contained tasks.

Implementations

impl TaskSet

pub fn new() -> Self

Empty task set.

pub fn push(&mut self, task: Task)

Adds a task.

pub fn len(&self) -> usize

Number of tasks.

pub fn is_empty(&self) -> bool

Whether the task set is empty.

pub fn utilization(&self) -> f64

Total utilization U = Σ C_i/T_i.

pub fn liu_layland_bound(n: usize) -> f64

The Liu & Layland utilization bound n·(2^(1/n) − 1) for n tasks.

pub fn assign_rate_monotonic(&mut self)

Assigns rate-monotonic priorities: shorter period → higher priority. The priorities are assigned evenly across 0..=MAX in order (unique, as long as ≤ 32768 tasks).

pub fn response_time(&self, i: usize) -> Option<u64>

Exact worst-case response time R_i of task i via fixed-point iteration. None if R_i exceeds the deadline (task not schedulable).

pub fn response_times(&self) -> Vec<Option<u64>>

Response times of all tasks (index-parallel to tasks).

pub fn is_schedulable_rta(&self) -> bool

Exact schedulability test (response-time analysis): all R_i ≤ D_i.

pub fn is_schedulable_ll(&self) -> bool

Sufficient schedulability test (Liu & Layland): U ≤ n·(2^(1/n) − 1). Only meaningful for rate-monotonic with implicit deadlines; a false does not necessarily mean not-schedulable (use RTA in that case).

Trait Implementations

impl Clone for TaskSet

fn clone(&self) -> TaskSet

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TaskSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for TaskSet

fn default() -> TaskSet

Returns the “default value” for a type.