Commit a2e2342c authored by Martin PORTALIER's avatar Martin PORTALIER

Update readme.md

parent 2b71ab39
Pipeline #19291 failed with stages
in 2 minutes and 10 seconds
......@@ -64,14 +64,15 @@ Finally, to demonstrate that the workload bound is reached we prove that :
### To go further
One problem in those files is that the workload definition is not the same in the intermediate file and is the workload_bound_fp file.
It is possible to unify those two one at the begining but I did not do it since I noticed the difference after proving the bound.
One problem in those files is that the workload definition is not the same in the intermediate file and in the workload_bound_fp file.
It is possible to unify those two one at the begining, but I didn't do it since I noticed the difference after proving
that the job response time is bounded.
Neverthless it is mandatory to unifiy those definitions to prove that the bound is reached (as we need to show an exact equality).
Therefore, I proved the equivalence of those two definitions a bit late, but doing it ealier could simplify a lot some other proof.
It could be a good improvement to clarify the whole proof.
Therefore, I proved the equivalence of those two definitions a bit late.
Doing it ealier could be a good improvement to clarify the whole proof since it simplifies a lot some other lemma proofs.
Another problem is that I did not prove that all jobs complete.
Another problem is that I didn't prove that all jobs complete.
One way to demonstrate it should be to suppose that the utilization of the job-considered highest prority level is less than 1.
In other words, the processor is not busy for this priority level.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment