Examining Linux 2.6 Page-Cache Performance
Given the current trends towards ubiquitous 64-bit server/desktop computing with large amounts of cheap system memory, the performance and structure of the Linux page-cache will undoubtedly become more important in the future. An empirical and analytical examination of performance will be valuable in guiding future development.
The current 2.6 radix-tree based design represents a huge leap forward from the old global hash-table design, but there may be some issues with the current radix-tree structure itself.
The main goal is to understand performance of the current implementation, examine performance with respect to other potential data-structures, and look at ways to improve concurrency.