Struct Curve 

pub struct Curve { /* private fields */ }

The WCET curve model of a task’s cumulative execution-time demand. Similar to arrival curves, the cost of n consecutive jobs is specified by a vector of cumulative WCET for 1,2,3,… jobs and extrapolated from there.

Implementations

impl Curve

pub fn new(wcet_of_n_jobs: Vec<Service>) -> Self

Create a new WCET curve model based on the given finite prefix of cumulative demand.

The reference input wcet_of_n_jobs is assumed to start at one job, i.e., the first element of the vector (at offset zero) holds the maximum cost of any one job, the second element of the vector (at offset one) holds the cumulative cost of any two consecutive jobs, the third element of the vector (at offset two) holds the cumulative cost of any three consecutive jobs, etc.

Note: the constructor currently doesn’t check whether the input is well-formed, so garbage in => garbage out…

impl Curve

pub fn from_trace( job_costs: impl Iterator<Item = Service>, max_n: usize, ) -> Curve

pub fn extrapolate(&mut self, n: usize)

Trait Implementations

impl Clone for Curve

fn clone(&self) -> Curve

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Curve

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

Formats the value using the given formatter.

impl FromIterator<Service> for Curve

fn from_iter<I: IntoIterator<Item = Service>>(iter: I) -> Curve

Creates a value from an iterator.

impl JobCostModel for Curve

fn cost_of_jobs(&self, n: usize) -> Service

Model: yield the maximum cumulative processor demand of any n consecutive jobs.

fn job_cost_iter<'a>(&'a self) -> Box<dyn Iterator<Item = Service> + 'a>

Model: iterate the maximum WCETs of any sequence of consecutive jobs.

fn least_wcet(&self, n: usize) -> Service

Model: yield the WCET of the job with the least WCET among any sequence of n consecutive jobs.