Linux kernel hash table behavior: Analysis and improvements

被引:0
作者
Lever, C [1 ]
机构
[1] Univ Michigan, Ctr Informat Technol Integrat, Linux Scalabil Project, Ann Arbor, MI 48109 USA
来源
USENIX ASSOCIATION PROCEEDINGS OF THE 4TH ANNUAL LINUX SHOWCASE AND CONFERENCE, ATLANTA | 2000年
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The Linux kernel stores high-usage data objects such as pages, buffers, and inodes in data structures known as hash tables. In this report we analyze existing static hash tables to study the benefits of dynamically sized hash tables. We find significant performance boosts with careful analysis and tuning of these critical kernel data structures.
引用
收藏
页码:13 / 26
页数:14
相关论文
共 10 条
[1]  
[Anonymous], LINUX KERNEL MAILING
[2]  
[Anonymous], 1998, SORTING SEARCHING
[3]  
Beyer W.H., 1978, CRC standard mathematical tables
[4]  
Cormen T. H., 1990, INTRO ALGORITHMS
[5]  
*INT CORP, PENT 2 PROC REF MAN
[6]  
*MOT INC, 1998, MC68030 US MAN, V2
[7]  
Patterson DavidA., 1996, Computer architecture: a quantitative approach, V2nd
[8]  
SCHMIT ML, 1995, PENTIUM TM PROCESSOR
[9]  
*SPEC, 1991, SYST DEV MULT BENCHM
[10]  
1998, LARGEST KNOWN PRIMES