A Scalable Triangle Counting Algorithm on GPU
碩士 === 國立清華大學 === 資訊工程學系 === 103 === Triangle counting of a graph plays an important role in social network and network science, such as finding the clustering coefficients. Hence, a fast triangle counting algorithm and imple-mentation is critical for network analysis. However, different trian...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/87504813789308519316 |
id |
ndltd-TW-103NTHU5392149 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-103NTHU53921492016-08-15T04:17:37Z http://ndltd.ncl.edu.tw/handle/87504813789308519316 A Scalable Triangle Counting Algorithm on GPU GPU上具擴充性的三角形計數演算法 Cheng, Ya Ju 鄭雅如 碩士 國立清華大學 資訊工程學系 103 Triangle counting of a graph plays an important role in social network and network science, such as finding the clustering coefficients. Hence, a fast triangle counting algorithm and imple-mentation is critical for network analysis. However, different triangle counting algorithms only work well on some particular graphs with specific properties, such as density. No single algorithm and implementation can satisfy all kinds of graph. In this thesis, we introduce a scalable triangle counting algorithm and its implementation on GPU. This algorithm has three steps. First, it reorders the origin graph based on the degree of vertices. Reordering not only makes it easier to apply different algorithms on graphs with dif-ferent properties, but also achieves load balance between the computing nodes. Second, it parti-tions the graph into several sub-graphs for parallelization and scalability. Last, each sub-problem is solved on different computing nodes and the results are merged. We evaluated our implementation using the graphs from SNAP and DIMACS 10th Graph Challenge. Experimental results show that our implementation is over 20% faster than solving the whole graph with single algorithm. Lee, Che Rung 李哲榮 2015 學位論文 ; thesis 27 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 資訊工程學系 === 103 === Triangle counting of a graph plays an important role in social network and network science, such as finding the clustering coefficients. Hence, a fast triangle counting algorithm and imple-mentation is critical for network analysis. However, different triangle counting algorithms only work well on some particular graphs with specific properties, such as density. No single algorithm and implementation can satisfy all kinds of graph.
In this thesis, we introduce a scalable triangle counting algorithm and its implementation on GPU. This algorithm has three steps. First, it reorders the origin graph based on the degree of vertices. Reordering not only makes it easier to apply different algorithms on graphs with dif-ferent properties, but also achieves load balance between the computing nodes. Second, it parti-tions the graph into several sub-graphs for parallelization and scalability. Last, each sub-problem is solved on different computing nodes and the results are merged.
We evaluated our implementation using the graphs from SNAP and DIMACS 10th Graph Challenge. Experimental results show that our implementation is over 20% faster than solving the whole graph with single algorithm.
|
author2 |
Lee, Che Rung |
author_facet |
Lee, Che Rung Cheng, Ya Ju 鄭雅如 |
author |
Cheng, Ya Ju 鄭雅如 |
spellingShingle |
Cheng, Ya Ju 鄭雅如 A Scalable Triangle Counting Algorithm on GPU |
author_sort |
Cheng, Ya Ju |
title |
A Scalable Triangle Counting Algorithm on GPU |
title_short |
A Scalable Triangle Counting Algorithm on GPU |
title_full |
A Scalable Triangle Counting Algorithm on GPU |
title_fullStr |
A Scalable Triangle Counting Algorithm on GPU |
title_full_unstemmed |
A Scalable Triangle Counting Algorithm on GPU |
title_sort |
scalable triangle counting algorithm on gpu |
publishDate |
2015 |
url |
http://ndltd.ncl.edu.tw/handle/87504813789308519316 |
work_keys_str_mv |
AT chengyaju ascalabletrianglecountingalgorithmongpu AT zhèngyǎrú ascalabletrianglecountingalgorithmongpu AT chengyaju gpushàngjùkuòchōngxìngdesānjiǎoxíngjìshùyǎnsuànfǎ AT zhèngyǎrú gpushàngjùkuòchōngxìngdesānjiǎoxíngjìshùyǎnsuànfǎ AT chengyaju scalabletrianglecountingalgorithmongpu AT zhèngyǎrú scalabletrianglecountingalgorithmongpu |
_version_ |
1718376259010953216 |