kernel/sched.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) Index: linux-2.6.15-rc3-ck1/kernel/sched.c =================================================================== --- linux-2.6.15-rc3-ck1.orig/kernel/sched.c 2005-11-30 09:28:21.000000000 +1100 +++ linux-2.6.15-rc3-ck1/kernel/sched.c 2005-11-30 09:28:22.000000000 +1100 @@ -16,9 +16,9 @@ * by Davide Libenzi, preemptible kernel bits by Robert Love. * 2003-09-03 Interactivity tuning by Con Kolivas. * 2004-04-02 Scheduler domains code by Nick Piggin - * 2005-11-08 New staircase scheduling policy by Con Kolivas with help + * 2005-11-20 New staircase scheduling policy by Con Kolivas with help * from William Lee Irwin III, Zwane Mwaikambo & Peter Williams. - * Staircase v13 + * Staircase v13.1 */ #include @@ -82,7 +82,7 @@ #define TASK_PREEMPTS_CURR(p, rq) \ ((p)->prio < (rq)->curr->prio) -int sched_compute = 0; +int sched_compute __read_mostly = 0; /* *This is the time all tasks within the same priority round robin. *compute setting is reserved for dedicated computational scheduling @@ -693,7 +693,7 @@ static void dec_bonus(task_t *p) * sched_interactive - sysctl which allows interactive tasks to have bonus * raise its priority. */ -int sched_interactive = 1; +int sched_interactive __read_mostly = 1; /* * effective_prio - dynamic priority dependent on bonus. @@ -1205,7 +1205,7 @@ static inline int wake_idle(int cpu, tas * cache_delay is the time preemption is delayed in sched_compute mode * and is set to a nominal 10ms. */ -static int cache_delay = 10 * HZ / 1001 + 1; +static int cache_delay __read_mostly = 10 * HZ / 1001 + 1; /* * Check to see if p preempts rq->curr and resched if it does. In compute