A parallel page cache: IOPS and caching for multicore systems

Authors:
Da Zheng;Randal Burns;Alexander S. Szalay
Affiliations:
Department of Computer Science, Johns Hopkins University;Department of Computer Science, Johns Hopkins University;Department of Physics and Astronomy, Johns Hopkins University
Venue:
HotStorage'12 Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems
Year:
2012

Citing 9
Cited 1

LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Towards a theory of cache-efficient algorithms

Journal of the ACM (JACM)
CLOCK-Pro: an effective improvement of the CLOCK replacement

ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
AWOL: an adaptive write optimizations layer

FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
The multikernel: a new OS architecture for scalable multicore systems

Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Benchmarking cloud serving systems with YCSB

Proceedings of the 1st ACM symposium on Cloud computing
An analysis of Linux scalability to many cores

OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
ARC: a self-tuning, low overhead replacement cache

FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
CAR: clock with adaptive replacement

FAST'04 Proceedings of the 3rd USENIX conference on File and storage technologies

Toward millions of file system IOPS on low-cost, commodity hardware

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a set-associative page cache for scalable parallelism of IOPS in multicore systems. The design eliminates lock contention and hardware cache misses by partitioning the global cache into many independent page sets, each requiring a small amount of metadata that fits in few processor cache lines. We extend this design with message passing among processors in a non-uniform memory architecture (NUMA). We evaluate the set-associative cache on 12-core processors and a 48- core NUMA to show that it realizes the scalable IOPS of direct I/O (no caching) and matches the cache hits rates of Linux's page cache. Set-associative caching maintains IOPS at scale in contrast to Linux for which IOPS crash beyond eight parallel threads.