Publications

Detailed Information

Finer-LRU: A Scalable page management scheme for HPC manycore architectures

Cited 2 time in Web of Science Cited 4 time in Scopus
Authors

Bang, Jiwoo; Kim, Chungyong; Kim, Sunggon; Chen, Qichen; Lee, Cheongjun; Byun, Eun-Kyu; Lee, Jaehwan; Eom, Hyeonsang

Issue Date
2021-05
Publisher
Institute of Electrical and Electronics Engineers Inc.
Citation
Proceedings - 2021 IEEE 35th International Parallel and Distributed Processing Symposium, IPDPS 2021, pp.567-576
Abstract
© 2021 IEEE.In HPC systems, the increasing need for a higher level of concurrency has led to packing more cores within a single chip. However, since multiple processes share memory space, the frequent access to resources in critical sections where only atomic operation has to be executed can result in poor performance. In this paper, we focus on reducing lock contention on the memory management system of an HPC manycore architecture. One of the critical sections causing severe lock contention in the I/O path is in the page management system, which uses multiple Least Recently Used (LRU) lists with a single lock instance. To solve this problem, we propose a Finer-LRU scheme, which optimizes the page reclamation process by splitting LRU lists into multiple sub-lists, each having its own lock instance. Our evaluation result shows that the Finer-LRU scheme can improve sequential write throughput by 57.03% and reduce latency by 98.94% compared to the baseline Linux kernel version 5.2.8 in the Intel Knights Landing (KNL) architecture.
URI
https://hdl.handle.net/10371/183744
DOI
https://doi.org/10.1109/IPDPS49936.2021.00065
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share