lkml.org 
[lkml]   [2010]   [Jul]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    SubjectRe: periods and deadlines in SCHED_DEADLINE
    From
    Date
    On Fri, 2010-07-09 at 15:38 +0200, Raistlin wrote:

    > - using periods for calculating the tasks' bandwidth and then using
    > deadlines for scheduling the tasks is going to work, but the
    > admission control test that you would need for ensuring anybody
    > will make its deadline is waaay more complex than Sum_i(BW_i)<1, even
    > for uniprocessors/partitionig. That one instead would gives you just
    > a very basic guarantee that the design in not completely broken
    > (formally, I think I should say it is only a necessary
    > condition :-)).

    Happen to have a paper handy that explains all this in a concise way?


    \
     
     \ /
      Last update: 2010-07-09 16:21    [W:0.020 / U:270.620 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site