Empirical Guide to Use of Persistent Memory for Large-Scale In-Memory Graph Analysis
  • Bae, Hanyeoreum
  • Kwon, Miryeong
  • Gouk, Donghyun
  • Han, Sanghyun
  • Koh, Sungjoon
  • 외 3명
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

5

초록

We investigate runtime environment characteristics and explore the challenges of conventional in-memory graph processing. This system-level analysis includes empirical results and observations, which are opposite to the existing expectations of graph application users. Specifically, since raw graph data are not the same as the in-memory graph data, processing a billion-scale graph exhausts all system resources and makes the target system unavailable due to out-of-memory at runtime.To address a lack of memory space problem for big-scale graph analysis, we configure real persistent memory devices (PMEMs) with different operation modes and system software frameworks. In this work, we introduce PMEM to a representative in-memory graph system, Ligra, and perform an in-depth analysis uncovering the performance behaviors of different PMEM-applied in-memory graph systems. Based on our observations, we modify Ligra to improve the graph processing performance with a solid level of data persistence. Our evaluation results reveal that Ligra, with our simple modification, exhibits 4.41× and 3.01× better performance than the original Ligra running on a virtual memory expansion and conventional persistent memory, respectively. © 2021 IEEE.

제목
Empirical Guide to Use of Persistent Memory for Large-Scale In-Memory Graph Analysis
저자
Bae, HanyeoreumKwon, MiryeongGouk, DonghyunHan, SanghyunKoh, SungjoonLee, ChangrimPark, DongchulJung, Myoungsoo
DOI
10.1109/ICCD53106.2021.00057
발행일
2021-12
유형
Proceedings Paper
저널명
Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
2021-October
페이지
316 ~ 320