On Thu, Aug 03, 2017 at 02:26:27PM +0900, sioh Lee wrote: > Thank you very much for reading and responding to my commit. > I understand the problem with crc32 you describe. > I will investigate – as the first step, I will try to compare the number of CoWs with jhash2 and crc32. And I will send you the experiment results. Also the number of KSM merges and ideally in a non simple workload. If the hash triggers false positives it's not just that there will be more CoWs, but the unstable tree will get more unstable and its ability to find equality will decrease. This is why I don't like to weaken the hash with a crc and I'd rather prefer to keep a real hash there (doesn't need to be a crypto one, but it'd be even better if it was). The hash isn't used to find equality, it's only used to find which pages are updated frequently (and if an app overwrites the same value over and over, not even a crypto hash would be capable to detect it). There were attempts to replace the hashing with a dirty bit set in hardware in the pagetable in fact, that would be the ideal way, but it's quite more complicated that way. Thanks, Andrea -- 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>
