Linux Kernel hash table behavior: analysis and improvements
Chuck Lever · Deep Blue (University of Michigan) · 2000
The Linux kernel employs hash table data structures to store high-usage data objects such as pages, buffers, inodes, and others. In this report we find significant performance boosts with careful analysis and tuning of four critical kernel data structures. April 13, 2000 Center for Information Technology Integration University of Michigan 519 West William Street Ann Arbor, MI 48103-4943 This document was written as part of the Linux Scalability Project. The work described in this paper was supported via grants from the Sun-Netscape Alliance, Intel, Dell, and IBM. For more information, see our home page. If you have comments or suggestions, email [email protected]. Copyright 2000 by the Regents of the University of Michigan, and by AOL-Netscape Inc. All rights reserved. Trademarked material referenced in this document is copyright by its respective owner. - 1 - Linux Kernel Hash Table Behavior: Analysis and Improvements Chuck Lever, Sun-Netscape Alliance 1. I...