Messages in this thread | | | Date | Sat, 23 Jan 2010 12:35:51 +0100 | From | Andi Kleen <> | Subject | Re: [PATCH 1/2] lib: more scalable list_sort() |
| |
> Burning CPU time to save on IO is a very valid tradeoff in > filesystem design - burning a few hundred millieseconds of CPU > time can result in savcwinge tens of seconds of IO time. Hence > passing big long lists to be sorted is not an indication of broken > design, it's an indication of understanding CPU time vs IO time > tradeoffs during design...
Burning long CPU time in kernel code without latency breaker code is always a sign of broken design. When you burn you have to check for reschedules. It's that simple.
-Andi
-- ak@linux.intel.com -- Speaking for myself only.
| |