On Sat, 30 Jun 2012, Petr Holasek wrote: > The problem of the first patch/RFC was that merging algorithm was unstable > and could merge pages with distance higher than was set up (described by > Nai Xia in RFC thread [1]). Sure, this instability could be solved, but for > ksm pages shared by many other pages on different nodes we would have to still > recalculate which page is "in the middle" and in case of change migrate it > between nodes every time when ksmd reach new shareable page or when some > sharing page is removed. > Or you could simply refuse to ever merge any page that is identical to a page on a node with a distance greater than the threshold, i.e. never merge pages even under the threshold if a page exists on a node higher than the threshold. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@xxxxxxxxx. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"dont@xxxxxxxxx";> email@xxxxxxxxx </a>