[lkml]   [2013]   [Oct]   [14]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH 03/14] sched: SCHED_DEADLINE structures & implementation.
On 10/14/2013 01:49 PM, Peter Zijlstra wrote:
> On Mon, Oct 14, 2013 at 12:43:35PM +0200, Juri Lelli wrote:
>> +/*
>> + * Yield task semantic for -deadline tasks is:
>> + *
>> + * get off from the CPU until our next instance, with
>> + * a new runtime.
>> + */
> Could you amend that comment with a reason for why this is so? I have
> vague recollections of a discussion on this subject but can't recall. It
> seems like a useful thing to have.

I think discussion happened before I started maintaining the patchset, but I'm
quite sure this would be helpful for bandwidth reclaiming mechanisms.
Basically, if I'm able to report that I didn't use all the budget of my current
instance, I could donate that remaining budget to other task instances.
Bandwidth reclaiming is another nice thing to have, and we actually have some
ideas on how to implement it (TODO list always grows :)).

I'll amend the comment saying that this function is of little use now, but will
be helpful in the future.


- Juri

 \ /
  Last update: 2013-10-15 04:41    [W:0.127 / U:1.320 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site