On 2014/6/19 17:13, Luca Abeni wrote:
On 06/18/2014 09:01 AM, xiaofeng.yan wrote:
[...]
I also had an implementation of the GRUB algorithm (based on a
modification
of my old CBS scheduler for Linux), but the computational
complexity of the
algorithm was too high. That's why I never proposed to
On 06/18/2014 09:01 AM, xiaofeng.yan wrote:
[...]
I also had an implementation of the GRUB algorithm (based on a modification
of my old CBS scheduler for Linux), but the computational complexity of the
algorithm was too high. That's why I never proposed to merge it in
SCHED_DEADLINE.
But maybe
On 06/18/2014 09:01 AM, xiaofeng.yan wrote:
[...]
I also had an implementation of the GRUB algorithm (based on a modification
of my old CBS scheduler for Linux), but the computational complexity of the
algorithm was too high. That's why I never proposed to merge it in
SCHED_DEADLINE.
But maybe
On 2014/6/19 17:13, Luca Abeni wrote:
On 06/18/2014 09:01 AM, xiaofeng.yan wrote:
[...]
I also had an implementation of the GRUB algorithm (based on a
modification
of my old CBS scheduler for Linux), but the computational
complexity of the
algorithm was too high. That's why I never proposed to
On 2014/6/17 16:01, Luca Abeni wrote:
Hi,
On 06/17/2014 04:43 AM, xiaofeng.yan wrote:
[...]
The basic ideas are (warning! This is an over-simplification of the
algorithm! :)
- You assign runtime and period to each SCHED_DEADLINE task as usual
- Each task is guaranteed to receive its runtime
On 2014/6/17 16:01, Luca Abeni wrote:
Hi,
On 06/17/2014 04:43 AM, xiaofeng.yan wrote:
[...]
The basic ideas are (warning! This is an over-simplification of the
algorithm! :)
- You assign runtime and period to each SCHED_DEADLINE task as usual
- Each task is guaranteed to receive its runtime
Hi,
On 06/17/2014 04:43 AM, xiaofeng.yan wrote:
[...]
The basic ideas are (warning! This is an over-simplification of the algorithm!
:)
- You assign runtime and period to each SCHED_DEADLINE task as usual
- Each task is guaranteed to receive its runtime every period
- You can also define a
Hi,
On 06/17/2014 04:43 AM, xiaofeng.yan wrote:
[...]
The basic ideas are (warning! This is an over-simplification of the algorithm!
:)
- You assign runtime and period to each SCHED_DEADLINE task as usual
- Each task is guaranteed to receive its runtime every period
- You can also define a
On 2014/5/21 20:45, Luca Abeni wrote:
Hi,
first of all, sorry for the ultra-delayed reply: I've been busy,
and I did not notice this email... Anyway, some comments are below
On 05/16/2014 09:11 AM, Henrik Austad wrote:
[...]
This can also be implemented in user-space (without modifying the
On 2014/5/21 20:45, Luca Abeni wrote:
Hi,
first of all, sorry for the ultra-delayed reply: I've been busy,
and I did not notice this email... Anyway, some comments are below
On 05/16/2014 09:11 AM, Henrik Austad wrote:
[...]
This can also be implemented in user-space (without modifying the
Hi,
first of all, sorry for the ultra-delayed reply: I've been busy,
and I did not notice this email... Anyway, some comments are below
On 05/16/2014 09:11 AM, Henrik Austad wrote:
[...]
This can also be implemented in user-space (without modifying the
scheduler)
by having a daemon that
Hi,
first of all, sorry for the ultra-delayed reply: I've been busy,
and I did not notice this email... Anyway, some comments are below
On 05/16/2014 09:11 AM, Henrik Austad wrote:
[...]
This can also be implemented in user-space (without modifying the
scheduler)
by having a daemon that
On Thu, May 15, 2014 at 02:31:32PM +0200, Juri Lelli wrote:
> Hi,
Hi all,
> [Cc-ed lkml again to include Luca's reply]
>
> and thanks to Luca for his reply!
Indeed! and several great references. My backlog just got 3 more items
pushed :)
> On Thu, 15 May 2014 19:21:25 +0800
> "xiaofeng.yan"
On Thu, May 15, 2014 at 02:31:32PM +0200, Juri Lelli wrote:
Hi,
Hi all,
[Cc-ed lkml again to include Luca's reply]
and thanks to Luca for his reply!
Indeed! and several great references. My backlog just got 3 more items
pushed :)
On Thu, 15 May 2014 19:21:25 +0800
xiaofeng.yan
Hi,
[Cc-ed lkml again to include Luca's reply]
and thanks to Luca for his reply!
On Thu, 15 May 2014 19:21:25 +0800
"xiaofeng.yan" wrote:
> On 2014/5/14 21:17, Luca Abeni wrote:
> > Hi Peter,
> >
> > thanks for adding me in cc :)
> > This dynamic quota design looks similar to some resource
Hi,
[Cc-ed lkml again to include Luca's reply]
and thanks to Luca for his reply!
On Thu, 15 May 2014 19:21:25 +0800
xiaofeng.yan xiaofeng@huawei.com wrote:
On 2014/5/14 21:17, Luca Abeni wrote:
Hi Peter,
thanks for adding me in cc :)
This dynamic quota design looks similar to some
On Wed, May 14, 2014 at 01:32:45PM +0200, Peter Zijlstra wrote:
> On Wed, May 14, 2014 at 06:43:38PM +0800, xiaofeng.yan wrote:
> > Hi all,
> >
> > We design dynamic quota function based on current EDF schedule .
> > Wehave realized this dynamic quota design and get good performance in the
> >
On Wed, May 14, 2014 at 01:32:45PM +0200, Peter Zijlstra wrote:
On Wed, May 14, 2014 at 06:43:38PM +0800, xiaofeng.yan wrote:
Hi all,
We design dynamic quota function based on current EDF schedule .
Wehave realized this dynamic quota design and get good performance in the
actual
18 matches
Mail list logo
