Hyunseok Seo
ABSTRACT
Fast processing graph algorithms for large-scale graphs becomes increasingly important. Besides, there have been many attempts to process graph applications by exploiting the massive amount of parallelism of GPUs. However, most of the existing methods fail to process large-scale graphs that do not fit in GPU device memory. We propose a fast and scalable parallel processing method GStream that fully exploits the computational power of GPUs for processing large-scale graphs (e.g., billions vertices) very efficiently. It exploits the concept of nested-loop theta-join and multiple asynchronous GPU streams. Extensive experimental results show that GStream consistently and significantly outperforms the state-of-the art method.
- A. Gharaibeh, L. Beltrao Costa, E. Santos-Neto, and M. Ripeanu. A yoke of oxen and a thousand chickens for heavy lifting graph processing. In PACT, 2012. Google Scholar
Digital Library
- W.-S. Han, S. Lee, K. Park, J.-H. Lee, M.-S. Kim, J. Kim, and H. Yu, Turbograph: A fast parallel graph engine handling billion-scale graphs in a single pc. In KDD, 2013. Google ScholarDigital Library
Index Terms
- GStream: a graph streaming processing method for large-scale graphs on GPUs
Recommendations
GTS: A Fast and Scalable Graph Processing Method based on Streaming Topology to GPUs
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataA fast and scalable graph processing method becomes increasingly important as graphs become popular in a wide range of applications and their sizes are growing rapidly. Most of distributed graph processing methods require a lot of machines equipped with ...
Graph Processing on GPUs: A Survey
In the big data era, much real-world data can be naturally represented as graphs. Consequently, many application domains can be modeled as graph processing. Graph processing, especially the processing of the large-scale graphs with the number of ...
GStream: a graph streaming processing method for large-scale graphs on GPUs
PPoPP '15Fast processing graph algorithms for large-scale graphs becomes increasingly important. Besides, there have been many attempts to process graph applications by exploiting the massive amount of parallelism of GPUs. However, most of the existing methods ...
Comments