Title
GraphM: an efficient storage system for high throughput of concurrent graph processing
Abstract
With the rapidly growing demand of graph processing in the real world, a large number of iterative graph processing jobs run concurrently on the same underlying graph. However, the storage engines of existing graph processing frameworks are mainly designed for running an individual job. Our studies show that they are inefficient when running concurrent jobs due to the redundant data storage and access overhead. To cope with this issue, we develop an efficient storage system, called GraphM. It can be integrated into the existing graph processing systems to efficiently support concurrent iterative graph processing jobs for higher throughput by fully exploiting the similarities of the data accesses between these concurrent jobs. GraphM regularizes the traversing order of the graph partitions for concurrent graph processing jobs by streaming the partitions into the main memory and the Last-Level Cache (LLC) in a common order, and then processes the related jobs concurrently in a novel fine-grained synchronization. In this way, the concurrent jobs share the same graph structure data in the LLC/memory and also the data accesses to the graph, so as to amortize the storage consumption and the data access overhead. To demonstrate the efficiency of GraphM, we plug it into state-of-the-art graph processing systems, including GridGraph, GraphChi, PowerGraph, and Chaos. Experiments results show that GraphM improves the throughput by 1.73~13 times.
Year
DOI
Venue
2019
10.1145/3295500.3356143
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
Keywords
Field
DocType
concurrent jobs, data access similarity, iterative graph processing, storage system
Graph,Synchronization,Cache,Computer data storage,Computer science,Parallel computing,Throughput,Data access,Distributed computing,Traverse
Conference
ISBN
Citations 
PageRank 
978-1-4503-6229-0
3
0.37
References 
Authors
0
8
Name
Order
Citations
PageRank
jin zhao1123.30
Yu Zhang26917.13
Xiaofei Liao31145120.57
Ligang He454256.73
Bingsheng He52810179.09
Hai Jin66544644.63
Haikun Liu760935.79
Yicheng Chen830.37