projects / openwrt / staging / blogic.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: f333fdc) | patch
sched: use a 2-d bitmap for searching lowest-pri CPU
authorGregory Haskins <ghaskins@novell.com>
Mon, 12 May 2008 19:21:01 +0000 (21:21 +0200)
committerIngo Molnar <mingo@elte.hu>
Fri, 6 Jun 2008 13:19:28 +0000 (15:19 +0200)
commit6e0534f278199f1e3dd1049b9bc19a7a5b87ada1
tree25f4da14ec32927742db9f599ac779b4e83d1763tree | snapshot
parentf333fdc9098b71e2687e4e9b6349fcb352960d66commit | diff
sched: use a 2-d bitmap for searching lowest-pri CPU

The current code use a linear algorithm which causes scaling issues
on larger SMP machines.  This patch replaces that algorithm with a
2-dimensional bitmap to reduce latencies in the wake-up path.

Signed-off-by: Gregory Haskins <ghaskins@novell.com>
Acked-by: Steven Rostedt <srostedt@redhat.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
kernel/Makefile diff | blob | history
kernel/sched.c diff | blob | history
kernel/sched_cpupri.c [new file with mode: 0644] blob
kernel/sched_cpupri.h [new file with mode: 0644] blob
kernel/sched_rt.c diff | blob | history
John Crispins staging tree