CFS完全公平调度算法

struct sched_avg {
 /*
  * These sums represent an infinite geometric series and so are bound
  * above by 1024/(1-y).  Thus we only need a u32 to store them for all
  * choices of y < 1-2^(-32)*1024.
  */
 u32 runnable_avg_sum, runnable_avg_period;    /* 前一个：调度实体累计负载均衡值（不包括未进入运行队列期间的负载均衡值）；后一个：调度实体累计负载均衡值*/
 u64 last_runnable_update;    /* 最近一次更新负载均衡值的时间，用ns表示 */
 s64 decay_count;    /* 衰减次数 */
 unsigned long load_avg_contrib;    /* 该调度实体对它所属的CFS_RQ队列的负载均衡贡献值 */
};


调度实体的负载均衡值周期性的被更新，由__update_entity_runnable_avg（）函数实际执行该操作。struct sched_avg用于跟踪调度实体的负载变更情况。

 * We can represent the historical contribution to runnable average as the

 * coefficients