Messages in this thread | | | Date | Mon, 6 Feb 2006 06:35:49 -0800 | From | Paul Jackson <> | Subject | Re: [PATCH 1/5] cpuset memory spread basic implementation |
| |
Andi wrote: > Perhaps one could do a "near" caching policy for big machines: e.g. > if on a big Altix prefer to put it on a not too far away node, but > spread it out evenly. But it's not clear yet such complexity is needed.
I suspect that spreading evenly over the current tasks mems_allowed is just what is needed.
There is nothing special about big Altix systems here; just use task->mems_allowed. For all but tasks using MPOL_BIND, this means spreading the caching over the nodes in the tasks cpuset.
We don't want to spread over a larger area, because cpusets need to maintain a fairly aggressive containment. One jobs big data set must not pollute the cpuset of another job, except in cases involving kernel distress.
-- I won't rest till it's the best ... Programmer, Linux Scalability Paul Jackson <pj@sgi.com> 1.925.600.0401 - 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/
| |