On Mon, 29 Oct 2007, Paul Jackson wrote:If your argument is that most applications are written to implement mempolicies without necessarily thinking too much about its cpuset placement or interactions with cpusets, then the requirement of remapping nodes when a cpuset changes for effected mempolicies isn't actually that important. In other words, my Choice C with AND'd behavior as opposed to remapping behavior could be introduced as a replacement for Choice A. Those applications that currently rely on the remapping are going to be broken anyway because they are unknowingly receiving different nodes than they intended, this is the objection to remapping that Lee agreed with. The remap doesn't take into account any notion of locality or affinity to physical controllers and seems to be merely a convenience of not invalidating the entire mempolicy in light of an ever-changing cpuset policy. Yes, I know, and my Choice C does _not_ want that folding behavior; it wants the AND'd behavior because it fully respects the intent of the application with regard to the actual nodes that it specified in its memory policies. A node should only have one definition and policies that are effected on a set of nodes, or one node in the preferred case, should not change from beneath the application because it was not the intent of the implementation. Doing so is dangerous, regardless of whether or not it is currently the mempolicy behavior in HEAD. David -
| Peter Zijlstra | [PATCH 00/23] per device dirty throttling -v8 |
| david | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Greg Kroah-Hartman | [PATCH 005/196] Chinese: add translation of SubmittingDrivers |
| Vladislav Bolkhovitin | Re: Integration of SCST in the mainstream Linux kernel |
git: | |
| Gerrit Renker | [PATCH 03/37] dccp: List management for new feature negotiation |
| Frans Pop | svc: failed to register lockdv1 RPC service (errno 97). |
| David Miller | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | [GIT]: Networking |
