On Thu, Aug 28, 2014 at 11:00:26AM +0100, Juri Lelli wrote:Well, AFAIR "closest" was suggested during the initial review some months ago...
From: Luca Abeni <luca.abeni@xxxxxxxx>
Several small changes regarding SCHED_DEADLINE documentation that fix
terminology and improve clarity and readability:
- "current runtime" becomes "remaining runtime"
- readablity of an equation is improved by introducing more spacing
- clarify when admission control will certainly fail
- new URL for CBS technical report
- substitue "smallest" with "closest"
I'm tempted to say "earliest" (being part of the algorithm's name and all
;)
I agree with these changes, but they are in text that is not changed by mySumming up, the CBS[2,3] algorithms assigns scheduling deadlines to tasks so
that each task runs for at most its runtime every period, avoiding any
interference between different tasks (bandwidth isolation), while the EDF[1]
- algorithm selects the task with the smallest scheduling deadline as the one
+ algorithm selects the task with the closest scheduling deadline as the one
to be executed first. Thanks to this feature, also tasks that do not
s/first/next/
Also, next sentence does not make much sense, I would drop the also;
"Thanks to this feature, tasks that do not strictly comply with the ..."