ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Fast and Secure Global-Heap for Memory-Centric Computing
Cited 1 time in scopus Download 27 time Share share facebook twitter linkedin kakaostory
저자
차명훈, 이상민, 안백송, 김홍연, 김강호
발행일
202110
출처
Journal of Supercomputing, v.77 no.11, pp.13262-13291
ISSN
0920-8542
출판사
Springer
DOI
https://dx.doi.org/10.1007/s11227-021-03806-4
협약과제
20HS3800, 차세대 공유/혼성 메모리 기반 통합 데이터 모델을 제공하는 메모리 중심 운영체제 기술개발, 김홍연
초록
In-memory computing has been widely used to process data quickly in memory, but it is no longer able to cope with the current data explosion. This has occurred because modern computers have structural constraints in terms of both memory capacity and bandwidth, fundamentally limiting the amount of data that can be processed in memory. In order to overcome these limitations, the memory-centric computing concept was proposed, and as an attempt to make this concept feasible, nonvolatile memory, next-generation interconnects, and memory-centric operating system technologies are being actively studied. Although, however, there have been many studies of these concepts, the essential problem of both efficiently and safely using the extremely large memory space has not been completely solved. This paper proposes what is termed Global-Heap which solves the above essential problem, thus supporting the core technology of memory-centric computing. In this technology, a heap-level abstraction which can be switched very lightly between processes is provided in an application-friendly manner as a global resource. Global-Heap also provides an effective means by which safely to use this vast address space based on Intel memory protection keys. We implemented Global-Heap on Linux and developed three useful use cases applicable to data-centric applications. Our primary evaluation shows that Global-Heap enables reorganization-free hashing. In addition, Global-Heap can improve the performance of an in-memory key-value store, Redis, by at least 7.56 times, and it can reduce the running time of graph applications executed in a pipeline approach by at least 48%.
KSP 제안 키워드
Address space, Data explosion, Data-centric applications, Graph applications, In-Memory Computing, Key-Value store, Large memory, Memory protection, Memory space, Next-generation, Non-Volatile Memory(NVM)