DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
<|reference_start|>DGAP: Efficient Dynamic Graph Analysis on Persistent Memory: Dynamic graphs, featuring continuously updated vertices and edges, have grown in importance for numerous real-world applications. To accommodate this, graph frameworks, particularly their internal data structures, must support both persistent graph updates and rapid graph analysis simultaneously, leading to complex designs to orchestrate `fast but volatile' and `persistent but slow' storage devices. Emerging persistent memory technologies, such as Optane DCPMM, offer a promising alternative to simplify the designs by providing data persistence, low latency, and high IOPS together. In light of this, we propose DGAP, a framework for efficient dynamic graph analysis on persistent memory. Unlike traditional dynamic graph frameworks, which combine multiple graph data structures (e.g., edge list or adjacency list) to achieve the required performance, DGAP utilizes a single mutable Compressed Sparse Row (CSR) graph structure with new designs for persistent memory to construct the framework. Specifically, DGAP introduces a \textit{per-section edge log} to reduce write amplification on persistent memory; a \textit{per-thread undo log} to enable high-performance, crash-consistent rebalancing operations; and a data placement schema to minimize in-place updates on persistent memory. Our extensive evaluation results demonstrate that DGAP can achieve up to $3.2\times$ better graph update performance and up to $3.77\times$ better graph analysis performance compared to state-of-the-art dynamic graph frameworks for persistent memory, such as XPGraph, LLAMA, and GraphOne.<|reference_end|>
@article{islam2024dgap:,
    title={DGAP: Efficient Dynamic Graph Analysis on Persistent Memory},
    author={Abdullah Al Raqibul Islam, Dong Dai},
    journal={arXiv preprint arXiv:2403.02665},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.02665},
    primaryClass={cs.DS cs.DC cs.PF}
}