4 research outputs found

    Efficient Strategies for Graph Pattern Mining Algorithms on GPUs

    Full text link
    Graph Pattern Mining (GPM) is an important, rapidly evolving, and computation demanding area. GPM computation relies on subgraph enumeration, which consists in extracting subgraphs that match a given property from an input graph. Graphics Processing Units (GPUs) have been an effective platform to accelerate applications in many areas. However, the irregularity of subgraph enumeration makes it challenging for efficient execution on GPU due to typical uncoalesced memory access, divergence, and load imbalance. Unfortunately, these aspects have not been fully addressed in previous work. Thus, this work proposes novel strategies to design and implement subgraph enumeration efficiently on GPU. We support a depth-first search style search (DFS-wide) that maximizes memory performance while providing enough parallelism to be exploited by the GPU, along with a warp-centric design that minimizes execution divergence and improves utilization of the computing capabilities. We also propose a low-cost load balancing layer to avoid idleness and redistribute work among thread warps in a GPU. Our strategies have been deployed in a system named DuMato, which provides a simple programming interface to allow efficient implementation of GPM algorithms. Our evaluation has shown that DuMato is often an order of magnitude faster than state-of-the-art GPM systems and can mine larger subgraphs (up to 12 vertices).Comment: Accepted for publication on IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'22

    Motifs in big networks : methods and applications

    Get PDF
    Motifs have been recognized as basic network blocks and are found to be quite powerful in modeling certain patterns. Generally speaking, local characteristics of big networks could be reflected in network motifs. Over the years, motifs have attracted a lot of attention from researchers. However, most current literature reviews on motifs generally focus on the field of biological science. In contrast, here we try to present a comprehensive survey on motifs in the context of big networks. We introduce the definition of motifs and other related concepts. Big networks with motif-based structures are analyzed. Specifically, we respectively analyze four kinds of networks, including biological networks, social networks, academic networks, and infrastructure networks. We then examine methods for motif discovery, motif counting, and motif clustering. The applications of motifs in different areas have also been reviewed. Finally, some challenges and open issues in this direction are discussed. © 2013 IEEE

    Parallelization of network motif discovery using star contraction

    No full text
    WOS:000614249000006Network motifs are widely used to uncover structural design principles of complex networks. Current sequential network motif discovery algorithms become inefficient as motif size grows, thus parallelization methods have been proposed in the literature. in this study, we use star contraction algorithm to partition complex networks efficiently for parallel discovery of network motifs. We propose two new heuristics to make star contraction more suitable for partitioning of complex networks. The effectiveness of our partitioning strategies is verified using the ESU algorithm for subgraph counting. We also propose a ghost vertices detection algorithm to ensure that all the motifs located in multiple parts are exactly found. We implement our method using MPI libraries and tested on real-life complex networks of different domains. We compared speedups of star contraction algorithm with speedups of other graph partitioning algorithms. Our algorithm obtained better speedups than those of other partitioning algorithms for most cases. Our algorithm provides significant speedups when compared to sequential ESU algorithm allowing discovery of larger network motifs.TUBITAK BIDEB-2211 National Scholarship Programme for PhD StudentsTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK)We thank the anonymous reviewers for their helpful comments. Esra R. Ateskan acknowledges the financial support of TUBITAK BIDEB-2211 National Scholarship Programme for PhD Students. The computational tests performed at TUBITAK ULAKBIM, High Performance and Grid Computing Center
    corecore