[lkml]   [2016]   [Aug]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
Subject[PATCH v1 00/10] Optimize sched avgs computation and implement flat util hierarchy
Hi Peter,

I should have sent out my flat util hierarchy implementation long time ago,
actually code was there but not rebased. I finally have time to do this,
so here it is. There are also other proposals to solve migrated tasks' util
mobility problem, such as the ones from Dietmar and Vincent.

The sched avgs computation optimization was initiated for the flat util thing,
so I send them out together.

According to Morten and Ben's feedback, I removed 32-bit as a period's upper
bound limit. So, thanks a lot to them.



Yuyang Du (10):
sched/fair: Chance LOAD_AVG_MAX_N from 345 to 347
documentation: Add scheduler/sched-avg.txt
sched/fair: Add static to remove_entity_load_avg()
sched/fair: Rename variable names for sched averages
sched/fair: Add __always_inline compiler attribute to
sched/fair: Optimize __update_sched_avg()
sched/fair: Remove useless 64-bit to 32-bit variable conversion
sched/fair: Remove scale_load_down() for load_avg
sched/fair: Rename scale_load() and scale_load_down()
sched/fair: Implement flat hierarchical structure for util_avg

Documentation/scheduler/sched-avg.txt | 94 ++++++
include/linux/sched.h | 21 +-
kernel/sched/core.c | 13 +-
kernel/sched/debug.c | 13 +-
kernel/sched/fair.c | 557 ++++++++++++++++++---------------
kernel/sched/sched.h | 27 +-
6 files changed, 436 insertions(+), 289 deletions(-)
create mode 100644 Documentation/scheduler/sched-avg.txt


 \ /
  Last update: 2016-08-10 22:41    [W:0.179 / U:3.744 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site