FAST '24 - Seraph: Towards Scalable and Efficient Fully-external Graph Computation via On-demand...

FAST '24 - Seraph: Towards Scalable and Efficient Fully-external Graph Computation via On-demand Processing

Tsun-Yu Yang, Yizou Chen, Yuhong Liang, and Ming-Chang Yang, The Chinese University of Hong Kong

Fully-external graph computation systems exhibit optimal scalability by computing the ever-growing, large-scale graph with constant amount of memory on a single machine. In particular, they keep the entire massive graph data in storage and iteratively load parts of them into memory for computation. Nevertheless, despite the merit of optimal scalability, their …

chen chinese computation computing demand external fast graph hong kong kong large memory on-demand scalability scale systems university