A Fine-Grained Page Management Scheme For Hpc Manycore I/O Systems

作     者：Bang, Jiwoo Kim, Chungyong Chen, Qichen Lee, Cheongjun Byun, Eun-Kyu Sung, Hanul Eom, Hyeonsang Lee, Jaehwan 

作者机构：Department of Computer Science and Engineering Seoul National University Seoul08826 Korea Republic of School of Electronics and Information Engineering Korea Aerospace University Goyang10540 Korea Republic of Division of National Supercomputing Korea Institute of Science and Technology Information Daejeon02456 Korea Republic of Department of Game Design and Development Sangmyung University Seoul03016 Korea Republic of 

出 版 物：《SSRN》 

年 卷 期：2022年

核心收录：

主　　题：Locks (fasteners) 

摘      要：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 operations are being 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. © 2022, The Authors. All rights reserved.