1
0
Files
linux/kernel
Gregory Haskins 74ab8e4f64 sched: use highest_prio.next to optimize pull operations
We currently take the rq->lock for every cpu in an overload state during
pull_rt_tasks().  However, we now have enough information via the
highest_prio.[curr|next] fields to determine if there is any tasks of
interest to warrant the overhead of the rq->lock, before we actually take
it.  So we use this information to reduce lock contention during the
pull for the case where the source-rq doesnt have tasks that preempt
the current task.

Signed-off-by: Gregory Haskins <ghaskins@novell.com>
2008-12-29 09:39:50 -05:00
..
2008-12-13 21:55:51 +10:30
2008-12-13 21:55:51 +10:30
2008-10-16 11:21:30 -07:00
2008-12-12 13:48:57 +01:00
2008-09-14 16:25:35 +02:00
2008-11-19 18:49:58 -08:00
2008-07-28 14:37:38 +02:00
2008-12-10 08:01:54 -08:00
2008-08-13 12:55:10 +02:00
2008-10-20 15:43:10 +02:00
2008-12-01 19:55:24 -08:00
2008-09-02 19:21:40 -07:00
2008-12-13 21:55:51 +10:30
2008-11-30 11:00:15 -08:00
2008-10-21 15:59:53 +02:00
2008-11-05 10:30:14 +01:00
2008-12-13 21:55:51 +10:30
2008-11-06 08:41:56 +01:00
2008-11-19 18:49:57 -08:00
2008-07-25 10:53:45 -07:00
2008-10-16 11:21:47 -07:00
2008-10-16 11:21:31 -07:00