---

yaml
---
r: 191389
b: refs/heads/master
c: 6bc6cf2
h: refs/heads/master
i:
  191387: f7aa55e
v: v3

[refs]

@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 8b911acdf08477c059d1c36c21113ab1696c612b
+refs/heads/master: 6bc6cf2b61336ed0c55a615eb4c0c8ed5daf3f08

trunk/kernel/sched_fair.c

@@ -741,16 +741,6 @@ place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int initial)
 	if (!initial && sched_feat(FAIR_SLEEPERS)) {
 		unsigned long thresh = sysctl_sched_latency;
 
-		/*
-		 * Convert the sleeper threshold into virtual time.
-		 * SCHED_IDLE is a special sub-class.  We care about
-		 * fairness only relative to other SCHED_IDLE tasks,
-		 * all of which have the same weight.
-		 */
-		if (sched_feat(NORMALIZED_SLEEPER) && (!entity_is_task(se) ||
-				 task_of(se)->policy != SCHED_IDLE))
-			thresh = calc_delta_fair(thresh, se);
-
 		/*
 		 * Halve their sleep time's effect, to allow
 		 * for a gentler effect of sleepers:

trunk/kernel/sched_features.h

@@ -12,13 +12,6 @@ SCHED_FEAT(FAIR_SLEEPERS, 1)
  */
 SCHED_FEAT(GENTLE_FAIR_SLEEPERS, 1)
 
-/*
- * By not normalizing the sleep time, heavy tasks get an effective
- * longer period, and lighter task an effective shorter period they
- * are considered running.
- */
-SCHED_FEAT(NORMALIZED_SLEEPER, 0)
-
 /*
  * Place new tasks ahead so that they do not starve already running
  * tasks