Messages in this thread | | | Subject | Re: [PATCH] dentry and inode cache hash algorithm performance changes. | From | Olaf Dietsche <> | Date | Sat, 01 May 2004 14:08:26 +0200 |
| |
"Jose R. Santos" <jrsantos@austin.ibm.com> writes:
> Anton was nice enough to provide some graphs that show the distribution > before and after the patch at http://samba.org/~anton/linux/sfs/1/
Judging from the graphs (!), I don't see a real difference for dcache. There's just one outlier (depth 11) for the old hash function, which seems to be translated to multiple depth 9 entries. The histograms seem to confirm, that there's at most a minimal difference, if they'd be equally scaled.
Maybe this is due to qstr hashes, which were used by both approaches as input?
The inode hash seems to be distributed more evenly with the new hash function. Although the inode histogram suggests, that most buckets are in the 0-2 depth range, with the old hash function leading slightly in the zero depth range.
Regards, Olaf. - 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/
| |