# Library prosa.results.fixed_priority.rta.fully_nonpreemptive

Require Export prosa.results.fixed_priority.rta.bounded_nps.

Require Export prosa.analysis.facts.preemption.task.nonpreemptive.

Require Export prosa.analysis.facts.preemption.rtc_threshold.nonpreemptive.

Require Export prosa.analysis.facts.readiness.sequential.

Require Export prosa.model.task.preemption.fully_nonpreemptive.

Require Export prosa.analysis.facts.preemption.task.nonpreemptive.

Require Export prosa.analysis.facts.preemption.rtc_threshold.nonpreemptive.

Require Export prosa.analysis.facts.readiness.sequential.

Require Export prosa.model.task.preemption.fully_nonpreemptive.

# RTA for Fully Non-Preemptive FP Model

In this module we prove the RTA theorem for the fully non-preemptive FP model.## Setup and Assumptions

We assume ideal uni-processor schedules.

Consider any type of tasks ...

... and any type of jobs associated with these tasks.

Context {Job : JobType}.

Context `{JobTask Job Task}.

Context `{JobArrival Job}.

Context `{JobCost Job}.

Context `{JobTask Job Task}.

Context `{JobArrival Job}.

Context `{JobCost Job}.

We assume that jobs and tasks are fully nonpreemptive.

#[local] Existing Instance fully_nonpreemptive_job_model.

#[local] Existing Instance fully_nonpreemptive_task_model.

#[local] Existing Instance fully_nonpreemptive_rtc_threshold.

#[local] Existing Instance fully_nonpreemptive_task_model.

#[local] Existing Instance fully_nonpreemptive_rtc_threshold.

Consider any arrival sequence with consistent, non-duplicate arrivals.

Variable arr_seq : arrival_sequence Job.

Hypothesis H_valid_arrival_sequence : valid_arrival_sequence arr_seq.

Hypothesis H_valid_arrival_sequence : valid_arrival_sequence arr_seq.

Consider an arbitrary task set ts, ...

... assume that all jobs come from the task set, ...

... and the cost of a job cannot be larger than the task cost.

Let max_arrivals be a family of valid arrival curves, i.e., for
any task tsk in ts max_arrival tsk is (1) an arrival bound of
tsk, and (2) it is a monotonic function that equals 0 for the
empty interval delta = 0.

Context `{MaxArrivals Task}.

Hypothesis H_valid_arrival_curve : valid_taskset_arrival_curve ts max_arrivals.

Hypothesis H_is_arrival_curve : taskset_respects_max_arrivals arr_seq ts.

Hypothesis H_valid_arrival_curve : valid_taskset_arrival_curve ts max_arrivals.

Hypothesis H_is_arrival_curve : taskset_respects_max_arrivals arr_seq ts.

Let tsk be any task in ts that is to be analyzed.

Recall that we assume sequential readiness.

Next, consider any ideal non-preemptive uniprocessor schedule of
this arrival sequence ...

Variable sched : schedule (ideal.processor_state Job).

Hypothesis H_sched_valid : valid_schedule sched arr_seq.

Hypothesis H_nonpreemptive_sched : nonpreemptive_schedule sched.

Hypothesis H_sched_valid : valid_schedule sched arr_seq.

Hypothesis H_nonpreemptive_sched : nonpreemptive_schedule sched.

Consider an FP policy that indicates a higher-or-equal priority relation,
and assume that the relation is reflexive and transitive.

Context {FP : FP_policy Task}.

Hypothesis H_priority_is_reflexive : reflexive_task_priorities FP.

Hypothesis H_priority_is_transitive : transitive_task_priorities FP.

Hypothesis H_priority_is_reflexive : reflexive_task_priorities FP.

Hypothesis H_priority_is_transitive : transitive_task_priorities FP.

Next, we assume that the schedule is a work-conserving schedule ...

... and the schedule respects the scheduling policy.

## Total Workload and Length of Busy Interval

Using the sum of individual request bound functions, we define
the request bound function of all tasks with higher priority
...

... and the request bound function of all tasks with higher
priority other than task tsk.

Next, we define a bound for the priority inversion caused by tasks of lower priority.

Let L be any positive fixed point of the busy interval recurrence, determined by
the sum of blocking and higher-or-equal-priority workload.

Variable L : duration.

Hypothesis H_L_positive : L > 0.

Hypothesis H_fixed_point : L = blocking_bound + total_hep_rbf L.

Hypothesis H_L_positive : L > 0.

Hypothesis H_fixed_point : L = blocking_bound + total_hep_rbf L.

## Response-Time Bound

Next, consider any value R, and assume that for any given
arrival A from search space there is a solution of the
response-time bound recurrence which is bounded by R.

Variable R : duration.

Hypothesis H_R_is_maximum:

∀ (A : duration),

is_in_search_space A →

∃ (F : duration),

A + F ≥ blocking_bound

+ (task_rbf (A + ε) - (task_cost tsk - ε))

+ total_ohep_rbf (A + F) ∧

R ≥ F + (task_cost tsk - ε).

Hypothesis H_R_is_maximum:

∀ (A : duration),

is_in_search_space A →

∃ (F : duration),

A + F ≥ blocking_bound

+ (task_rbf (A + ε) - (task_cost tsk - ε))

+ total_ohep_rbf (A + F) ∧

R ≥ F + (task_cost tsk - ε).

Now, we can leverage the results for the abstract model with
bounded nonpreemptive segments to establish a response-time
bound for the more concrete model of fully nonpreemptive
scheduling.

Let response_time_bounded_by := task_response_time_bound arr_seq sched.

Theorem uniprocessor_response_time_bound_fully_nonpreemptive_fp:

response_time_bounded_by tsk R.

Proof.

move: (posnP (@task_cost _ tc tsk)) ⇒ [ZERO|POS].

{ intros j ARR TSK.

have ZEROj: job_cost j = 0.

{ move: (H_valid_job_cost j ARR) ⇒ NEQ.

rewrite /valid_job_cost in NEQ.

move: TSK ⇒ /eqP → in NEQ.

rewrite ZERO in NEQ.

by apply/eqP; rewrite -leqn0.

}

by rewrite /job_response_time_bound /completed_by ZEROj.

}

eapply uniprocessor_response_time_bound_fp_with_bounded_nonpreemptive_segments with

(L := L) ⇒ //.

- exact: sequential_readiness_implies_work_bearing_readiness.

- exact: sequential_readiness_implies_sequential_tasks.

Qed.

End RTAforFullyNonPreemptiveFPModelwithArrivalCurves.