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.http://deepblue.lib.umich.edu/bitstream/2027.42/107902/1/citi-tr-00-1.pd
Data processing systems often leverage vector instructions to achieve higher performance. When apply...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
In this work, analysis, and modeling were employed to improve the Linux Scheduler for HPC use. The p...
The Linux kernel utilizes caches to speed up accesses to the high-usage objects that are normally st...
The Linux Scalability Project is adapting Linux for use in enterprise-scale networking environments....
URL to paper from conference siteThis paper analyzes the scalability of seven system applications (...
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free,...
Fast concurrent hash tables are an increasingly important building block as we scale systems to grea...
The Linux kernel currently supports a single user space page size, usually the minimum dic-tated by ...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
In highly cached and pipelined machines, operating system performance, and aggregate user/system per...
In the last decades, high-performance large-scale systems have been a fundamental tool for scientifi...
System time is increasing on enterprise workloads as multi-core and non-uniform memory architecture ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
BigData revolutionised the IT industry. It first interested the OLTP systems. Distributed Hash Table...
Data processing systems often leverage vector instructions to achieve higher performance. When apply...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
In this work, analysis, and modeling were employed to improve the Linux Scheduler for HPC use. The p...
The Linux kernel utilizes caches to speed up accesses to the high-usage objects that are normally st...
The Linux Scalability Project is adapting Linux for use in enterprise-scale networking environments....
URL to paper from conference siteThis paper analyzes the scalability of seven system applications (...
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free,...
Fast concurrent hash tables are an increasingly important building block as we scale systems to grea...
The Linux kernel currently supports a single user space page size, usually the minimum dic-tated by ...
A number of recent papers have considered the influence of modern computer memory hierarchies on the...
In highly cached and pipelined machines, operating system performance, and aggregate user/system per...
In the last decades, high-performance large-scale systems have been a fundamental tool for scientifi...
System time is increasing on enterprise workloads as multi-core and non-uniform memory architecture ...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
BigData revolutionised the IT industry. It first interested the OLTP systems. Distributed Hash Table...
Data processing systems often leverage vector instructions to achieve higher performance. When apply...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
In this work, analysis, and modeling were employed to improve the Linux Scheduler for HPC use. The p...
Add to ORKG