Network Motif Discovery: A GPU Approach
The identification of network motifs has important applications in numerous domains, such as pattern detection in biological networks and graph analysis in digital circuits. However, mining network motifs is computationally challenging, as it requires enumerating subgraphs from a real-life graph, an...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81386 http://hdl.handle.net/10220/43474 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-81386 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-813862020-03-07T11:48:54Z Network Motif Discovery: A GPU Approach Lin, Wenqing Xiao, Xiaokui Xie, Xing Li, Xiao-Li School of Computer Science and Engineering Network motif GPU The identification of network motifs has important applications in numerous domains, such as pattern detection in biological networks and graph analysis in digital circuits. However, mining network motifs is computationally challenging, as it requires enumerating subgraphs from a real-life graph, and computing the frequency of each subgraph in a large number of random graphs. In particular, existing solutions often require days to derive network motifs from biological networks with only a few thousand vertices. To address this problem, this paper presents a novel study on network motif discovery using Graphical Processing Units (GPUs). The basic idea is to employ GPUs to parallelize a large number of subgraph matching tasks in computing subgraph frequencies from random graphs, so as to reduce the overall computation time of network motif discovery. We explore the design space of GPU-based subgraph matching algorithms, with careful analysis of several crucial factors (such as branch divergences and memory coalescing) that affect the performance of GPU programs. Based on our analysis, we develop a GPU-based solution that (i) considerably differs from existing CPU-based methods in how it enumerates subgraphs, and (ii) exploits the strengths of GPUs in terms of parallelism while mitigating their limitations in terms of the computation power per GPU core. With extensive experiments on a variety of biological networks, we show that our solution is up to two orders of magnitude faster than the best CPU-based approach, and is around 20 times more cost-effective than the latter, when taking into account the monetary costs of the CPU and GPUs used. MOE (Min. of Education, S’pore) Accepted version 2017-07-27T08:50:14Z 2019-12-06T14:29:46Z 2017-07-27T08:50:14Z 2019-12-06T14:29:46Z 2016 Journal Article Lin, W., Xiao, X., Xie, X., & Li, X.-L. (2017). Network Motif Discovery: A GPU Approach. IEEE Transactions on Knowledge and Data Engineering, 29(3), 513-528. 1041-4347 https://hdl.handle.net/10356/81386 http://hdl.handle.net/10220/43474 10.1109/TKDE.2016.2566618 en IEEE Transactions on Knowledge and Data Engineering © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [ttp://dx.doi.org/10.1109/TKDE.2016.2566618]. 14 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Network motif GPU |
spellingShingle |
Network motif GPU Lin, Wenqing Xiao, Xiaokui Xie, Xing Li, Xiao-Li Network Motif Discovery: A GPU Approach |
description |
The identification of network motifs has important applications in numerous domains, such as pattern detection in biological networks and graph analysis in digital circuits. However, mining network motifs is computationally challenging, as it requires enumerating subgraphs from a real-life graph, and computing the frequency of each subgraph in a large number of random graphs. In particular, existing solutions often require days to derive network motifs from biological networks with only a few thousand vertices. To address this problem, this paper presents a novel study on network motif discovery using Graphical Processing Units (GPUs). The basic idea is to employ GPUs to parallelize a large number of subgraph matching tasks in computing subgraph frequencies from random graphs, so as to reduce the overall computation time of network motif discovery. We explore the design space of GPU-based subgraph matching algorithms, with careful analysis of several crucial factors (such as branch divergences and memory coalescing) that affect the performance of GPU programs. Based on our analysis, we develop a GPU-based solution that (i) considerably differs from existing CPU-based methods in how it enumerates subgraphs, and (ii) exploits the strengths of GPUs in terms of parallelism while mitigating their limitations in terms of the computation power per GPU core. With extensive experiments on a variety of biological networks, we show that our solution is up to two orders of magnitude faster than the best CPU-based approach, and is around 20 times more cost-effective than the latter, when taking into account the monetary costs of the CPU and GPUs used. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Lin, Wenqing Xiao, Xiaokui Xie, Xing Li, Xiao-Li |
format |
Article |
author |
Lin, Wenqing Xiao, Xiaokui Xie, Xing Li, Xiao-Li |
author_sort |
Lin, Wenqing |
title |
Network Motif Discovery: A GPU Approach |
title_short |
Network Motif Discovery: A GPU Approach |
title_full |
Network Motif Discovery: A GPU Approach |
title_fullStr |
Network Motif Discovery: A GPU Approach |
title_full_unstemmed |
Network Motif Discovery: A GPU Approach |
title_sort |
network motif discovery: a gpu approach |
publishDate |
2017 |
url |
https://hdl.handle.net/10356/81386 http://hdl.handle.net/10220/43474 |
_version_ |
1681034255862333440 |