- May 09, 2022
-
-
Björn Brandenburg authored
-
Björn Brandenburg authored
-
Björn Brandenburg authored
-
Björn Brandenburg authored
-
Björn Brandenburg authored
-
Björn Brandenburg authored
-
-
-
-
-
-
-
- May 06, 2022
-
-
The current definitions of `respects_JLFP_policy_at_preemption_time` and `respects_FP_policy_at_preemption_time` use the predicate `hep_job_at`. This predicate does not make sense for `JLFP` and `FP` policies. To avoid this, these definitions should instead use the definition `respects_JLDP_policy_at_preemption_point`. Doing this requires coercions from `JLFP` to `JLDP` and from `FP` to `JLFP`. This patch also introduces these coercions.
-
- May 05, 2022
-
-
- Apr 19, 2022
-
-
Björn Brandenburg authored
-
-
It is exactly big1_eq
-
-
It was subsumed by sum_nat_gt0
-
-
-
-
-
-
-
-
-
-
-
Too specific and one liner with existing MathComp lemmas.
-
Subsumed by existing MathComp lemmas on division.
-
-
-
- Apr 14, 2022
-
-
leq_trans and leq_addr seem to be enough.
-
Too specific.
-
This commit also removes one spurious dependency on ideal uni-processor. That is, previously file [model/service_of_jobs.v] imported [processor.ideal], which is wrong, since [model/service_of_jobs.v] assumes no specific model for processor.
-
-
As described in #92, the name `np_uni_schedule` is problematic. This patch renames the scheduler to the more appropriate `pmc_uni_schedule`. Closes: #92
-
To complement the existing interpretation, add one more instance of numeric fixed priority that assigns higher priority to lower numeric values.
-
-