research-article

Pangolin: an efficient and flexible graph mining system on CPU and GPU

Authors:

Roshan Dathathri,

Gurbinder Gill,

Keshav PingaliAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 13, Issue 8

Pages 1190 - 1205

https://doi.org/10.14778/3389133.3389137

Published: 01 April 2020 Publication History

Abstract

There is growing interest in graph pattern mining (GPM) problems such as motif counting. GPM systems have been developed to provide unified interfaces for programming algorithms for these problems and for running them on parallel systems. However, existing systems may take hours to mine even simple patterns in moderate-sized graphs, which significantly limits their real-world usability.

We present Pangolin, an efficient and flexible in-memory GPM framework targeting shared-memory CPUs and GPUs. Pangolin is the first GPM system that provides high-level abstractions for GPU processing. It provides a simple programming interface based on the extend-reduce-filter model, which allows users to specify application specific knowledge for search space pruning and isomorphism test elimination. We describe novel optimizations that exploit locality, reduce memory consumption, and mitigate the overheads of dynamic memory allocation and synchronization.

Evaluation on a 28-core CPU demonstrates that Pangolin outperforms existing GPM frameworks Arabesque, RStream, and Fractal by 49×, 88×, and 80× on average, respectively. Acceleration on a V100 GPU further improves performance of Pangolin by 15× on average. Compared to state-of-the-art hand-optimized GPM applications, Pangolin provides competitive performance with less programming effort.

References

[1]

E. Abdelhamid, I. Abdelaziz, P. Kalnis, Z. Khayyat, and F. Jamour. Scalemine: Scalable parallel frequent subgraph mining in a single large graph. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC '16, pages 61:1--61:12, Piscataway, NJ, USA, 2016. IEEE Press.

[2]

A. Aboulnaga, J. Xiang, and C. Guo. Scalable maximum clique computation using mapreduce. In Proceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013), ICDE '13, pages 74--85, Washington, DC, USA, 2013. IEEE Computer Society.

Digital Library

[3]

C. C. Aggarwal and H. Wang. Managing and Mining Graph Data. Springer US, 2010.

Digital Library

[4]

N. K. Ahmed, J. Neville, R. A. Rossi, and N. Duffield. Efficient graphlet counting for large networks. In ICDM, pages 1--10, 2015.

Digital Library

[5]

N. Alon, P. Dao, I. Hajirasouliha, F. Hormozdiari, and S. Sahinalp. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24(13):241--249, 2008.

Digital Library

[6]

N. Alon, R. Yuster, and U. Zwick. Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC '94, pages 326--335, New York, NY, USA, 1994. ACM.

Digital Library

[7]

P. Anchuri, M. J. Zaki, O. Barkol, S. Golan, and M. Shamy. Approximate graph mining with label costs. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '13, pages 518--526, New York, NY, USA, 2013. ACM.

Digital Library

[8]

L. Babai, W. M. Kantor, and E. M. Luks. Computational complexity and the classification of finite simple groups. In 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pages 162--171, Nov 1983.

Digital Library

[9]

A. Basak, S. Li, X. Hu, S. M. Oh, X. Xie, L. Zhao, X. Jiang, and Y. Xie. Analysis and optimization of the memory hierarchy for graph processing workloads. In 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA), pages 373--386, Feb 2019.

[10]

S. Beamer, K. Asanovic, and D. Patterson. Locality exists in graph processing: Workload characterization on an ivy bridge server. In Proceedings of the 2015 IEEE International Symposium on Workload Characterization, IISWC '15, pages 56--65, Washington, DC, USA, 2015. IEEE Computer Society.

Digital Library

[11]

S. Beamer, K. Asanovic, and D. A. Patterson. The GAP benchmark suite. CoRR, abs/1508.03619, 2015.

[12]

A. R. Benson, D. F. Gleich, and J. Leskovec. Higher-order organization of complex networks. Science, 353(6295):163--166, 2016.

[13]

E. D. Berger, K. S. McKinley, R. D. Blumofe, and P. R. Wilson. Hoard: A scalable memory allocator for multithreaded applications. In Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS IX, pages 117--128, New York, NY, USA, 2000. ACM.

Digital Library

[14]

B. Bhattarai, H. Liu, and H. H. Huang. Ceci: Compact embedding cluster index for scalable subgraph matching. In Proceedings of the 2019 International Conference on Management of Data, SIGMOD '19, pages 1447--1462, New York, NY, USA, 2019. ACM.

Digital Library

[15]

P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In Proc. of the Thirteenth International World Wide Web Conference (WWW 2004), pages 595--601, Manhattan, USA, 2004. ACM Press.

Digital Library

[16]

M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, and A. Panconesi. Counting graphlets: Space vs time. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM '17, pages 557--566, New York, NY, USA, 2017. ACM.

Digital Library

[17]

M. Bressan, F. Chierichetti, R. Kumar, S. Leucci, and A. Panconesi. Motif counting beyond five nodes. ACM Trans. Knowl. Discov. Data, 12(4):48:1--48:25, Apr. 2018.

Digital Library

[18]

M. Burtscher, R. Nasre, and K. Pingali. A quantitative study of irregular programs on gpus. In 2012 IEEE International Symposium on Workload Characterization (IISWC), pages 141--151, Nov 2012.

Digital Library

[19]

H. Chen, M. Liu, Y. Zhao, X. Yan, D. Yan, and J. Cheng. G-miner: An efficient task-oriented graph mining system. In Proceedings of the Thirteenth EuroSys Conference, EuroSys 18, New York, NY, USA, 2018. Association for Computing Machinery.

Digital Library

[20]

X. Chen and J. C. S. Lui. Mining graphlet counts in online social networks. ACM Trans. Knowl. Discov. Data, 12(4), Apr. 2018.

Digital Library

[21]

J. Cheng, L. Zhu, Y. Ke, and S. Chu. Fast algorithms for maximal clique enumeration with limited memory. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '12, pages 1240--1248, New York, NY, USA, 2012. ACM.

Digital Library

[22]

X. Cheng, C. Dale, and J. Liu. Dataset for statistics and social network of youtube videos. http://netsg.cs.sfu.ca/youtubedata/.

[23]

U. Cheramangalath, R. Nasre, and Y. N. Srikant. Falcon: A graph manipulation language for heterogeneous systems. ACM Trans. Archit. Code Optim., 12(4), Dec. 2015.

Digital Library

[24]

N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210--223, Feb. 1985.

Digital Library

[25]

Y.-R. Cho and A. Zhang. Predicting protein function by frequent functional association pattern mining in protein interaction networks. Trans. Info. Tech. Biomed., 14(1):30--36, Jan. 2010.

Digital Library

[26]

M. Danisch, O. Balalau, and M. Sozio. Listing k-cliques in sparse real-world graphs*. In Proceedings of the 2018 World Wide Web Conference, WWW '18, pages 589--598, Republic and Canton of Geneva, Switzerland, 2018. International World Wide Web Conferences Steering Committee.

[27]

R. Dathathri, G. Gill, L. Hoang, H.-V. Dang, A. Brooks, N. Dryden, M. Snir, and K. Pingali. Gluon: A communication-optimizing substrate for distributed heterogeneous graph analytics. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, pages 752--768, New York, NY, USA, 2018. ACM.

Digital Library

[28]

R. Dathathri, G. Gill, L. Hoang, H.-V. Dang, V. Jatala, V. K. Nandivada, M. Snir, and K. Pingali. Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics. In Proceedings of the 28th International Conference on Parallel Architectures and Compilation Techniques (PACT 2019), PACT '19. IEEE, 2019.

[29]

M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 17(8):1036--1050, Aug 2005.

Digital Library

[30]

V. Dias, C. H. C. Teixeira, D. Guedes, W. Meira, and S. Parthasarathy. Fractal: A general-purpose graph pattern mining system. In Proceedings of the 2019 International Conference on Management of Data, SIGMOD '19, pages 1357--1374, New York, NY, USA, 2019. ACM.

Digital Library

[31]

E. R. Elenberg, K. Shanmugam, M. Borokhovich, and A. G. Dimakis. Beyond triangles: A distributed framework for estimating 3-profiles of large graphs. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15, pages 229--238, New York, NY, USA, 2015. ACM.

Digital Library

[32]

M. Elseidy, E. Abdelhamid, S. Skiadopoulos, and P. Kalnis. Grami: Frequent subgraph and pattern mining in a single large graph. PVLDB, 7(7):517--528, 2014.

[33]

S. Eyerman, W. Heirman, K. D. Bois, J. B. Fryman, and I. Hur. Many-core graph workload analysis. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC '18, pages 22:1--22:11, Piscataway, NJ, USA, 2018. IEEE Press.

Digital Library

[34]

W. Fan, J. Xu, Y. Wu, W. Yu, J. Jiang, Z. Zheng, B. Zhang, Y. Cao, and C. Tian. Parallelizing sequential graph computations. In Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD 17, page 495510, New York, NY, USA, 2017. Association for Computing Machinery.

Digital Library

[35]

K. Faust. A puzzle concerning triads in social networks: Graph constraints and the triad census. Social Networks, 32(3):221 -- 233, 2010.

[36]

B. Gallagher. Matching structure and semantics: A survey on graph-based pattern matching. In AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection, 2006.

[37]

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979.

Digital Library

[38]

I. Giechaskiel, G. Panagopoulos, and E. Yoneki. PDTL: Parallel and distributed triangle listing for massive graphs. In 2015 44th International Conference on Parallel Processing, pages 370--379, Sep. 2015.

Digital Library

[39]

G. Gill, R. Dathathri, L. Hoang, R. Peri, and K. Pingali. Single machine graph analytics on massive datasets using intel optane DC persistent memory. CoRR, abs/1904.07162, 2019.

[40]

Apache Giraph. http://giraph.apache.org/, 2013.

[41]

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI'12, pages 17--30, Berkeley, CA, USA, 2012. USENIX Association.

Digital Library

[42]

O. Green, P. Yalamanchili, and L.-M. Munguia. Fast triangle counting on the gpu. In Proceedings of the 4th Workshop on Irregular Applications: Architectures and Algorithms, IA3 '14, pages 1--8, Piscataway, NJ, USA, 2014. IEEE Press.

Digital Library

[43]

B. H. Hall, J. A. B., and T. M. The NBER patent citation data file: Lessons, insights and methodological tools. http://www.nber.org/patents/, 2001.

[44]

L. Hoang, V. Jatala, X. Chen, U. Agarwal, R. Dathathri, G. Gill, and K. Pingali. DistTC: High performance distributed triangle counting. In HPEC 2019 23rd IEEE High Performance Extreme Computing, Graph Challenge, September 2019.

[45]

C. Hong, A. Sukumaran-Rajam, J. Kim, and P. Sadayappan. Multigraph: Efficient graph processing on gpus. In 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT), pages 27--40, Sep. 2017.

[46]

Y. Hu, H. Liu, and H. H. Huang. Tricore: Parallel triangle counting on gpus. In SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pages 171--182, Nov 2018.

Digital Library

[47]

A. P. Iyer, Z. Liu, X. Jin, S. Venkataraman, V. Braverman, and I. Stoica. Asap: Fast, approximate graph pattern mining at scale. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI'18, pages 745--761, Berkeley, CA, USA, 2018. USENIX Association.

[48]

S. Jain and C. Seshadhri. A fast and provable method for estimating clique counts using turan's theorem. In Proceedings of the 26th International Conference on World Wide Web, WWW '17, pages 441--449, Republic and Canton of Geneva, Switzerland, 2017. International World Wide Web Conferences Steering Committee.

Digital Library

[49]

M. Jha, C. Seshadhri, and A. Pinar. Path sampling: A fast and provable method for estimating 4-vertex subgraph counts. In Proceedings of the 24th International Conference on World Wide Web, WWW '15, pages 495--505, Republic and Canton of Geneva, Switzerland, 2015. International World Wide Web Conferences Steering Committee.

Digital Library

[50]

C. Jiang, F. Coenen, and M. Zito. A survey of frequent subgraph mining algorithms. The Knowledge Engineering Review, 000:1--31, 01 2004.

[51]

T. Junttila and P. Kaski. Engineering an efficient canonical labeling tool for large and sparse graphs. In Proceedings of the Meeting on Algorithm Engineering & Expermiments, pages 135--149, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.

Digital Library

[52]

R. Kessl, N. Talukder, P. Anchuri, and M. J. Zaki. Parallel graph mining with gpus. In Proceedings of the 3rd International Conference on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications - Volume 36, BIGMINE'14, pages 1--16. JMLR.org, 2014.

[53]

F. Khorasani, R. Gupta, and L. N. Bhuyan. Scalable simd-efficient graph processing on gpus. In Proceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT), PACT 15, page 3950, USA, 2015. IEEE Computer Society.

Digital Library

[54]

H. Kim, J. Lee, S. S. Bhowmick, W.-S. Han, J. Lee, S. Ko, and M. H. Jarrah. DUALSIM: Parallel subgraph enumeration in a massive graph on a single machine. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD '16, pages 1231--1245, New York, NY, USA, 2016. ACM.

Digital Library

[55]

K. Kim, I. Seo, W.-S. Han, J.-H. Lee, S. Hong, H. Chafi, H. Shin, and G. Jeong. Turbo ux: A fast continuous subgraph matching system for streaming graph data. In Proceedings of the 2018 International Conference on Management of Data, SIGMOD '18, pages 411--426, New York, NY, USA, 2018. ACM.

Digital Library

[56]

J. Kunegis. Konect: the koblenz network collection. In Proceedings of the 22nd International Conference on World Wide Web, pages 1343--1350. ACM, 2013.

Digital Library

[57]

L. Lai, L. Qin, X. Lin, and L. Chang. Scalable subgraph enumeration in mapreduce. PVLDB, 8(10):974--985, 2015.

Digital Library

[58]

J. Leskovec. Snap: Stanford network analysis platform, 2013.

[59]

W. Lin, X. Xiao, X. Xie, and X. Li. Network motif discovery: A gpu approach. In 2015 IEEE 31st International Conference on Data Engineering, pages 831--842, April 2015.

[60]

H. Liu and H. H. Huang. Simd-x: Programming and processing of graph algorithms on gpus. In Proceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference, USENIX ATC 19, page 411427, USA, 2019. USENIX Association.

[61]

Y. Liu, B. Schmidt, W. Liu, and D. L. Maskell. Cuda-meme: Accelerating motif discovery in biological sequences using cuda-enabled graphics processing units. Pattern Recognition Letters, 31(14):2170 -- 2177, 2010.

Digital Library

[62]

Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. GraphLab: A New Parallel Framework for Machine Learning. In Proceedings Conf. Uncertainty in Artificial Intelligence, UAI '10, July 2010.

[63]

C. Lu, J. X. Yu, H. Wei, and Y. Zhang. Finding the maximum clique in massive graphs. PVLDB, 10(11):1538--1549, 2017.

Digital Library

[64]

S. Ma, Y. Cao, J. Huai, and T. Wo. Distributed graph pattern matching. In Proceedings of the 21st International Conference on World Wide Web, WWW '12, pages 949--958, New York, NY, USA, 2012. ACM.

Digital Library

[65]

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A system for large-scale graph processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD '10, pages 135--146, New York, NY, USA, 2010. ACM.

Digital Library

[66]

D. Mawhirter and B. Wu. Automine: Harmonizing high-level abstraction and high performance for graph mining. In Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP 19, page 509523, New York, NY, USA, 2019. Association for Computing Machinery.

Digital Library

[67]

M. M. Michael. Scalable lock-free dynamic memory allocation. In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, PLDI '04, pages 35--46, New York, NY, USA, 2004. ACM.

Digital Library

[68]

R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298(5594):824--827, 2002.

[69]

M. Mitzenmacher, J. Pachocki, R. Peng, C. Tsourakakis, and S. C. Xu. Scalable large near-clique detection in large-scale networks via sampling. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15, pages 815--824, New York, NY, USA, 2015. ACM.

Digital Library

[70]

D. Nguyen, A. Lenharth, and K. Pingali. A lightweight infrastructure for graph analytics. In Proceedings of the 24th ACM Symposium on Operating Systems Principles (SOSP), SOSP '13, pages 456--471, New York, NY, USA, 2013. ACM.

Digital Library

[71]

A. Pinar, C. Seshadhri, and V. Vishal. Escape: Efficiently counting all 5-vertex subgraphs. In Proceedings of the 26th International Conference on World Wide Web, WWW '17, pages 1431--1440, Republic and Canton of Geneva, Switzerland, 2017. International World Wide Web Conferences Steering Committee.

Digital Library

[72]

M. Rahman and M. A. Hasan. Approximate triangle counting algorithms on multi-cores. In 2013 IEEE International Conference on Big Data, pages 127--133, Oct 2013.

[73]

R. A. Rossi and R. Zhou. Leveraging multiple gpus and cpus for graphlet counting in large networks. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, CIKM '16, pages 1783--1792, New York, NY, USA, 2016. ACM.

Digital Library

[74]

T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the 4th International Conference on Experimental and Efficient Algorithms, WEA'05, pages 606--609, Berlin, Heidelberg, 2005. Springer-Verlag.

Digital Library

[75]

S. Schneider, C. D. Antonopoulos, and D. S. Nikolopoulos. Scalable locality-conscious multithreaded memory allocation. In Proceedings of the 5th International Symposium on Memory Management, ISMM '06, pages 84--94, New York, NY, USA, 2006. ACM.

Digital Library

[76]

D. Sengupta and S. L. Song. Evograph: On-the-fly efficient mining of evolving graphs on gpu. In J. M. Kunkel, R. Yokota, P. Balaji, and D. Keyes, editors, High Performance Computing, pages 97--119, Cham, 2017. Springer International Publishing.

[77]

Y. Shao, B. Cui, L. Chen, L. Ma, J. Yao, and N. Xu. Parallel subgraph listing in a large-scale graph. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD '14, pages 625--636, New York, NY, USA, 2014. ACM.

Digital Library

[78]

J. Shun and G. E. Blelloch. Ligra: A lightweight graph processing framework for shared memory. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), PPoPP '13, pages 135--146, New York, NY, USA, 2013. ACM.

Digital Library

[79]

J. Shun and K. Tangwongsan. Multicore triangle computations without tuning. In 2015 IEEE 31st International Conference on Data Engineering, pages 149--160, April 2015.

[80]

G. M. Slota and K. Madduri. Complex network analysis using parallel approximate motif counting. In 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pages 405--414, May 2014.

Digital Library

[81]

S. Suri and S. Vassilvitskii. Counting triangles and the curse of the last reducer. In Proceedings of the 20th International Conference on World Wide Web, WWW '11, pages 607--614, New York, NY, USA, 2011. ACM.

Digital Library

[82]

N. Talukder and M. J. Zaki. A distributed approach for graph mining in massive networks. Data Min. Knowl. Discov., 30(5):1024--1052, Sept. 2016.

Digital Library

[83]

N. Talukder and M. J. Zaki. Parallel graph mining with dynamic load balancing. In 2016 IEEE International Conference on Big Data (Big Data), pages 3352--3359, Dec 2016.

[84]

C. H. C. Teixeira, A. J. Fonseca, M. Serafini, G. Siganos, M. J. Zaki, and A. Aboulnaga. Arabesque: A system for distributed graph mining. In Proceedings of the 25th Symposium on Operating Systems Principles, SOSP '15, pages 425--440, New York, NY, USA, 2015. ACM.

Digital Library

[85]

C. E. Tsourakakis. Fast counting of triangles in large real networks without counting: Algorithms and laws. In 2008 Eighth IEEE International Conference on Data Mining, pages 608--617, Dec 2008.

Digital Library

[86]

C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos. Doulion: Counting triangles in massive graphs with a coin. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pages 837--846, New York, NY, USA, 2009. ACM.

Digital Library

[87]

C. Voegele, Y.-S. Lu, S. Pai, and K. Pingali. Parallel triangle counting and k-truss identification using graph-centric methods. In IEEE/Amazon/DARPA GraphChallenge, IEEE HPEC, 2017.

[88]

K. Wang, Z. Zuo, J. Thorpe, T. Q. Nguyen, and G. H. Xu. Rstream: Marrying relational algebra with streaming for efficient graph mining on a single machine. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI'18, pages 763--782, Berkeley, CA, USA, 2018. USENIX Association.

[89]

T. Washio and H. Motoda. State of the art of graph-based data mining. SIGKDD Explor. Newsl., 5(1):5968, July 2003.

Digital Library

[90]

Xifeng Yan and Jiawei Han. gspan: graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining, pages 721--724, Dec 2002.

[91]

C. Zhao, Z. Zhang, P. Xu, T. Zheng, and X. Cheng. Kaleido: An efficient out-of-core graph mining system on A single machine. CoRR, abs/1905.09572, 2019.

[92]

X. Zhu, W. Chen, W. Zheng, and X. Ma. Gemini: A Computation-centric Distributed Graph Processing System. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation, OSDI'16, pages 301--316, Berkeley, CA, USA, 2016. USENIX Association.

Digital Library

Cited By

Cai STian BZhang HGao M(2024)PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory HardwareProceedings of the ACM on Management of Data10.1145/36549642:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654964
Zhang ZLu YZheng WLin X(2024)A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and InteractionProceedings of the ACM on Management of Data10.1145/36393152:1(1-29)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639315
Yan DYuan LAhmad AZheng CChen HCheng JBaeza-Yates RBonchi F(2024)Systems for Scalable Graph Analytics and Machine Learning: Trends and MethodsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671472(6627-6632)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671472
Show More Cited By

Recommendations

Evaluation of Rodinia Codes on Intel Xeon Phi
ISMS '13: Proceedings of the 2013 4th International Conference on Intelligent Systems, Modelling and Simulation

High performance computing (HPC) is a niche area where various parallel benchmarks are constantly used to explore and evaluate the performance of Heterogeneous computing systems on the horizon. The Rodinia benchmark suite, a collection of parallel ...
Mars: Accelerating MapReduce with Graphics Processors

We design and implement Mars, a MapReduce runtime system accelerated with graphics processing units (GPUs). MapReduce is a simple and flexible parallel programming paradigm originally proposed by Google, for the ease of large-scale data processing on ...
On the Efficacy of a Fused CPU+GPU Processor (or APU) for Parallel Computing
SAAHPC '11: Proceedings of the 2011 Symposium on Application Accelerators in High-Performance Computing

The graphics processing unit (GPU) has made significant strides as an accelerator in parallel computing. However, because the GPU has resided out on PCIe as a discrete device, the performance of GPU applications can be bottlenecked by data transfers ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 13, Issue 8

April 2020

172 pages

ISSN:2150-8097

Editors:
Magdalena Balazinska
University of Washington
,
Xiaofang Zhou
University of Queensland, Australia

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 April 2020

Published in PVLDB Volume 13, Issue 8

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
696
Total Downloads

Downloads (Last 12 months)109
Downloads (Last 6 weeks)21

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Cai STian BZhang HGao M(2024)PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory HardwareProceedings of the ACM on Management of Data10.1145/36549642:3(1-25)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654964
Zhang ZLu YZheng WLin X(2024)A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and InteractionProceedings of the ACM on Management of Data10.1145/36393152:1(1-29)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639315
Yan DYuan LAhmad AZheng CChen HCheng JBaeza-Yates RBonchi F(2024)Systems for Scalable Graph Analytics and Machine Learning: Trends and MethodsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671472(6627-6632)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671472
Che JJamshidi KVora K(2024)Contigra: Graph Mining with Containment ConstraintsProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629589(50-65)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629589
Lin ZMeng KShui CZhang KXiao JTan GLee IChabbi MSteuwer M(2024)Exploiting Fine-Grained Redundancy in Set-Centric Graph Pattern MiningProceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3627535.3638507(175-187)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1145/3627535.3638507
Xia YZhang FXu QZhang MYao ZLu LDu XDeng DHe BMa S(2024)GPU-based butterfly countingThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00861-033:5(1543-1567)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1007/s00778-024-00861-0
Yuan YYe HVedula SKaza WTalati N(2023)Everest: GPU-Accelerated System for Mining Temporal MotifsProceedings of the VLDB Endowment10.14778/3626292.362629917:2(162-174)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.14778/3626292.3626299
Hussein RLerner ARyser ABürgi LBlarer ACudre-Mauroux P(2023)GraphINC: Graph Pattern Mining at Network SpeedProceedings of the ACM on Management of Data10.1145/35893291:2(1-28)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589329
Yuan LYan DQu WAdhikari SKhalil JLong CWang X(2023)T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big GraphProceedings of the ACM on Management of Data10.1145/35889281:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588928
Jin TLi BLi YZhou QMa QZhao YChen HCheng J(2023)Circinus: Fast Redundancy-Reduced Subgraph MatchingProceedings of the ACM on Management of Data10.1145/35886921:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588692
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents