On Wed, Sep 3, 2014 at 8:49 AM, Luca Abeni <luca.abeni@xxxxxxxx> wrote:Well, there are multiple papers to be cited here: the one showing that
Hi,
On 09/02/2014 11:45 PM, Henrik Austad wrote:
[...]
+ On multiprocessor systems with global EDF scheduling (non partitioned
Well, my original plan was to add the bibliography in the next round of+ systems), a sufficient test for schedulability can not be based on the
+ utilisations (it can be shown that task sets with utilisations slightly
+ larger than 1 can miss deadlines regardless of the number of CPUs M).
+ However, as previously stated, enforcing that the total utilisation is
smaller
+ than M is enough to guarantee that non real-time tasks are not starved
and
+ that the tardiness of real-time tasks has an upper bound.
I'd _really_ appreciate a link to a paper where all of this is presented
and proved!
patches...
Is this ok?
Sure, but I don't see why you cannot add this now
you (or Juri?) did update one of the papers in this series, right?In patch 1, I updated the URL for a publically available technical report I wrote
As long as an article with all the headache ends up here, I'm happy :)As said, if possible I'd like to do it in the next batch of patches, so that