Messages in this thread | | | Subject | Re: Can context switches be faster? | From | Alan Cox <> | Date | Sat, 14 Oct 2006 01:30:12 +0100 |
| |
Ar Sad, 2006-10-14 am 01:32 +0200, ysgrifennodd Andreas Mohr: > OK, so since we've now amply worked out in this thread that TLB/cache flushing > is a real problem for context switching management, would it be possible to > smartly reorder processes on the runqueue (probably works best with many active > processes with the same/similar priority on the runqueue!) to minimize > TLB flushing needs due to less mm context differences of adjacently scheduled > processes?
We already do. The newer x86 processors also have TLB tagging so they can (if you find one without errata!) avoid the actual flush and instead track the tag.
Alan - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |