Skip to main content
Top
Published in: World Wide Web 3/2022

26-10-2021

Unified-memory-based hybrid processing for partition-oriented subgraph matching on GPU

Authors: Jing Chen, Qiange Wang, Yu Gu, Chuanwen Li, Ge Yu

Published in: World Wide Web | Issue 3/2022

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Subgraph isomorphism is a well known NP-hard problem that is to find all the matched subgraphs of a query graph in a large target graph. The state-of-the-art GPU-based solution is the vertex-oriented joining strategy, which is proposed by GSI. It effectively solves the problem of parallel write conflicts by taking vertices as processing units. However, this strategy may result in load-imbalance and redundant memory transactions. Moreover, due to the limitation of GPU memory, extending the existing frameworks to large-scale graph is difficult. To solve the first problem, we design a new storage structure Level-CSR and a new partition-oriented joining strategy. To avoid the influence of vertices with large degrees, we divide the dense vertices in traditional CSR into several GPU-friendly tasks and store them in Level-CSR. Then, an efficient execution strategy is designed based on the partitioned tasks. The partition strategy can reduce the load imbalance caused by the irregularity of real-world graphs, and further reduce the redundant global memory access caused by the redundant neighbor set accessing. To solve the second problem, we design a unified-memory-based hybrid processing strategy to support out-of-GPU subgraph matching. By leveraging unified-memory-based data movement and active vertex-based access mode switching strategy, our hybrid strategy can leverage the large storage of host memory and achieve efficient data movement between GPU and CPU. Besides, to further improve the performance, we propose a well-directed filtering strategy by exploiting a property of real-world graphs. The experiments show that compared with the state-of-the-art GPU based solutions, our approach can effectively reduce the number of unrelated candidates, minimize memory transactions, and achieve load balance between processors. And our unified-memory-based hybrid processing strategy can outperform the single access mode-based strategy under different parameter settings.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Footnotes
1
the vertices that have edges connected with the joined vertex
 
Literature
1.
go back to reference Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD Conference 2016, June 26 - July 01, 2016, pp. 1199–1214 (2016) Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD Conference 2016, June 26 - July 01, 2016, pp. 1199–1214 (2016)
2.
go back to reference Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265–298 (2004) Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265–298 (2004)
3.
go back to reference Chen, J., Gu, Y., Wang, Q., Li, C., Yu, G.: Partition-oriented subgraph matching on GPU. APWeb/WAIM 2020, LNCS 12317, 53–68 (2020) Chen, J., Gu, Y., Wang, Q., Li, C., Yu, G.: Partition-oriented subgraph matching on GPU. APWeb/WAIM 2020, LNCS 12317, 53–68 (2020)
4.
go back to reference Garey, MR, Johnson, DS: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman (1979) Garey, MR, Johnson, DS: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman (1979)
5.
go back to reference Gera, P., Kim, H., Sao, P., Kim, H., Bader, DA: Traversing large graphs on GPUs with unified memory. Proc. VLDB Endow. 13(7), 1119–1133 (2020)CrossRef Gera, P., Kim, H., Sao, P., Kim, H., Bader, DA: Traversing large graphs on GPUs with unified memory. Proc. VLDB Endow. 13(7), 1119–1133 (2020)CrossRef
6.
go back to reference Gonzalez, JE, Low, Y., Haijie, G., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: OSDI 2012, October 8–10, 2012, pp. 17–30 (2012) Gonzalez, JE, Low, Y., Haijie, G., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: OSDI 2012, October 8–10, 2012, pp. 17–30 (2012)
7.
go back to reference Ha, N.T., Kim, J.-J., He, B.: Fast subgraph matching on large graphs using graphics processors. In: DASFAA 2015, April 20–23, 2015 Proceedings, Part I, pp. 299–315 (2015) Ha, N.T., Kim, J.-J., He, B.: Fast subgraph matching on large graphs using graphics processors. In: DASFAA 2015, April 20–23, 2015 Proceedings, Part I, pp. 299–315 (2015)
8.
go back to reference Han, W., Mawhirter, D., Wu, B., Buland, M.: Graphie: Large-scale asynchronous graph traversals on just a GPU. PACT 233–245 (2017) Han, W., Mawhirter, D., Wu, B., Buland, M.: Graphie: Large-scale asynchronous graph traversals on just a GPU. PACT 233–245 (2017)
9.
go back to reference Han, W.-S., Lee, J., Lee, J.-H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD 2013, June 22–27, 2013, pp. 337–348 (2013) Han, W.-S., Lee, J., Lee, J.-H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD 2013, June 22–27, 2013, pp. 337–348 (2013)
10.
go back to reference He, B., Fang, W., Luo, Q., Govindaraju, N.K., Wang, T.: Mars: a mapreduce framework on graphics processors. In: PACT 2008, October 25–29, 2008, pp. 260–269 (2008) He, B., Fang, W., Luo, Q., Govindaraju, N.K., Wang, T.: Mars: a mapreduce framework on graphics processors. In: PACT 2008, October 25–29, 2008, pp. 260–269 (2008)
11.
go back to reference Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating CUDA graph algorithms at maximum warp. In: PPOPP 2011, February 12–16, 2011, pp. 267–276 (2011) Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating CUDA graph algorithms at maximum warp. In: PPOPP 2011, February 12–16, 2011, pp. 267–276 (2011)
15.
go back to reference Kim, M.-S., An, K., Park, H., Seo, H., Kim, J.: GTS: A fast and scalable graph processing method based on streaming topology to GPUs. SIGMOD June 26-July 01, 2016, 447–461 (2020) Kim, M.-S., An, K., Park, H., Seo, H., Kim, J.: GTS: A fast and scalable graph processing method based on streaming topology to GPUs. SIGMOD June 26-July 01, 2016, 447–461 (2020)
16.
go back to reference Kim, S., Song, I., Lee, Y.-J.: An edge-based framework for fast subgraph matching in a large graph. In: DASFAA 2011, April 22–25, 2011, Proceedings, Part I, pp. 404–417 (2011) Kim, S., Song, I., Lee, Y.-J.: An edge-based framework for fast subgraph matching in a large graph. In: DASFAA 2011, April 22–25, 2011, Proceedings, Part I, pp. 404–417 (2011)
18.
go back to reference Li, Z., Zou, L., Tamer Özsu, M., Lin, H., Zhang, F.: GSI: gpu-friendly subgraph isomorphism. arXiv:1906.03420 (2019) Li, Z., Zou, L., Tamer Özsu, M., Lin, H., Zhang, F.: GSI: gpu-friendly subgraph isomorphism. arXiv:1906.​03420 (2019)
19.
go back to reference Liu, G., Zheng, K., Wang, Y., Orgun, MA, An, L., Zhao, L., Zhou, X.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE 2015, April 13–17, 2015, pp. 351–362 (2015) Liu, G., Zheng, K., Wang, Y., Orgun, MA, An, L., Zhao, L., Zhou, X.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE 2015, April 13–17, 2015, pp. 351–362 (2015)
20.
go back to reference Liu, H., Keselj, V., Blouin, C.: Biological event extraction using subgraph matching. In ISSMB (2010) Liu, H., Keselj, V., Blouin, C.: Biological event extraction using subgraph matching. In ISSMB (2010)
21.
go back to reference Ma, T., Siyang, Y u, Cao, J., Tian, Y., Al-Dhelaan, A., Al-Rodhaan, M.: A comparative study of subgraph matching isomorphic methods in social networks. IEEE Access 6, 66621–66631 (2018)CrossRef Ma, T., Siyang, Y u, Cao, J., Tian, Y., Al-Dhelaan, A., Al-Rodhaan, M.: A comparative study of subgraph matching isomorphic methods in social networks. IEEE Access 6, 66621–66631 (2018)CrossRef
22.
go back to reference Ma, L., Yang, Z., Chen, H., Xue, J., Garaph, Y.D.: Efficient GPU-accelerated graph processing on a single machine with balanced replication. In: USENIX Annual Technical Conference, pp. 195–207 (2017) Ma, L., Yang, Z., Chen, H., Xue, J., Garaph, Y.D.: Efficient GPU-accelerated graph processing on a single machine with balanced replication. In: USENIX Annual Technical Conference, pp. 195–207 (2017)
23.
go back to reference Merrill, D., Garland, M., Grimshaw, A.S.: Scalable GPU graph traversal. In: PPOPP 2012, February 25–29, 2012, pp. 117–128 (2012) Merrill, D., Garland, M., Grimshaw, A.S.: Scalable GPU graph traversal. In: PPOPP 2012, February 25–29, 2012, pp. 117–128 (2012)
24.
go back to reference Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. PVLDB 8(5), 617–628 (2015) Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. PVLDB 8(5), 617–628 (2015)
25.
go back to reference Sabet, A.H.N., Zhao, Z., Gupta, R.: Subway: minimizing data transfer during out-of-GPU-memory graph processing. EuroSys April 27–30, 2020, 12:1–12:16 (2020) Sabet, A.H.N., Zhao, Z., Gupta, R.: Subway: minimizing data transfer during out-of-GPU-memory graph processing. EuroSys April 27–30, 2020, 12:1–12:16 (2020)
26.
go back to reference Sengupta, D., Song, S.L., Agarwal, K., Schwan, K.: GraphReduce: processing large-scale graphs on accelerator-based systems. SC November 15–20, 2015, 28:1–28:12 (2020) Sengupta, D., Song, S.L., Agarwal, K., Schwan, K.: GraphReduce: processing large-scale graphs on accelerator-based systems. SC November 15–20, 2015, 28:1–28:12 (2020)
27.
go back to reference Seungwon, M., Vikram, S.M., Zaid, Q., Jinjun, X., Eiman, E., Hwu, W.-M.W. : EMOGI: Efficient memory-access for out-of-memory graph-traversal. In GPUs. arXiv:2006.06890 (2020) Seungwon, M., Vikram, S.M., Zaid, Q., Jinjun, X., Eiman, E., Hwu, W.-M.W. : EMOGI: Efficient memory-access for out-of-memory graph-traversal. In GPUs. arXiv:2006.​06890 (2020)
28.
go back to reference Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364–375 (2008) Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364–375 (2008)
29.
go back to reference Son, M.-Y., Kim, Y.-H., Oh, B.-W.: An efficient parallel algorithm for graph isomorphism on GPU using CUDA. In: IJET, 7(5) Oct-Nov, pp. 1840–1848 (2015) Son, M.-Y., Kim, Y.-H., Oh, B.-W.: An efficient parallel algorithm for graph isomorphism on GPU using CUDA. In: IJET, 7(5) Oct-Nov, pp. 1840–1848 (2015)
31.
go back to reference Wang, H., Geng, L., Lee, R., Hou, K., Zhang, Y., Zhang, X.: SEP-graph: finding shortest execution paths for graph processing under a hybrid framework on GPU. PPoPP February 16–20, 2019, 38–52 (2019) Wang, H., Geng, L., Lee, R., Hou, K., Zhang, Y., Zhang, X.: SEP-graph: finding shortest execution paths for graph processing under a hybrid framework on GPU. PPoPP February 16–20, 2019, 38–52 (2019)
32.
go back to reference Wang, Y., Davidson, A.A., Pan, Y., Yuduo, W., Riffel, A., Owens, J.D.: Gunrock: a high-performance graph processing library on the GPU. In: PPoPP 2016, March 12–16, 2016, pp. 11:1–11:12 (2016) Wang, Y., Davidson, A.A., Pan, Y., Yuduo, W., Riffel, A., Owens, J.D.: Gunrock: a high-performance graph processing library on the GPU. In: PPoPP 2016, March 12–16, 2016, pp. 11:1–11:12 (2016)
33.
go back to reference Yan, X, Yu, PS, Jiawei Han.: Graph indexing: A frequent structure-based approach. In: SIGMOD June 13–18, 2004, pp. 335–346 (2004) Yan, X, Yu, PS, Jiawei Han.: Graph indexing: A frequent structure-based approach. In: SIGMOD June 13–18, 2004, pp. 335–346 (2004)
34.
go back to reference Yanping, W., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310–322 (2021)CrossRef Yanping, W., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310–322 (2021)CrossRef
35.
go back to reference Zheng, L., Li, X., Zheng, Y., Huang, Y., Liao, X., Jin, H., Xue, J., Shao, Z., Hua, Q.-S.: Scaph: Scalable GPU-accelerated graph processing with value-driven differential scheduling. In: USENIX Annual Technical Conference, pp. 573–588 (2020) Zheng, L., Li, X., Zheng, Y., Huang, Y., Liao, X., Jin, H., Xue, J., Shao, Z., Hua, Q.-S.: Scaph: Scalable GPU-accelerated graph processing with value-driven differential scheduling. In: USENIX Annual Technical Conference, pp. 573–588 (2020)
36.
go back to reference Zou, L., Mo, J., Chen, L., Tamer Özsu, M., Zhao, D.: gstore: Answering SPARQL queries via subgraph matching. PVLDB 4(8), 482–493 (2011) Zou, L., Mo, J., Chen, L., Tamer Özsu, M., Zhao, D.: gstore: Answering SPARQL queries via subgraph matching. PVLDB 4(8), 482–493 (2011)
Metadata
Title
Unified-memory-based hybrid processing for partition-oriented subgraph matching on GPU
Authors
Jing Chen
Qiange Wang
Yu Gu
Chuanwen Li
Ge Yu
Publication date
26-10-2021
Publisher
Springer US
Published in
World Wide Web / Issue 3/2022
Print ISSN: 1386-145X
Electronic ISSN: 1573-1413
DOI
https://doi.org/10.1007/s11280-021-00952-w

Other articles of this Issue 3/2022

World Wide Web 3/2022 Go to the issue

Emerging Blockchain Applications and Technology

ELM-based data distribution model in ElasticChain

Premium Partner