GPU-based high-performance graph mining method and system

A graph mining, high-performance technology, applied in the field of GPU-based high-performance graph mining and systems, can solve the problem of low efficiency of graph mining algorithms, and achieve the effect of accelerating graph mining process, alleviating memory pressure, and good descriptiveness.

Inactive Publication Date: 2020-10-27
中科院计算所西部高等技术研究院
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a GPU-based high-performance graph mining method and system to solve the problem of low efficiency of current graph mining algorithms

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • GPU-based high-performance graph mining method and system
  • GPU-based high-performance graph mining method and system
  • GPU-based high-performance graph mining method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] Such as figure 1 The shown GPU-based high-performance graph mining method includes the following steps:

[0039] S1: According to different graph mining applications, construct corresponding search spaces; due to different graph mining applications, the corresponding search spaces are also different. Under normal circumstances, the search space of the application is the entire large graph, and the system mines the required subgraphs in the large graph.

[0040] S2: Select a number of vertices or edges in the search space according to the subgraph information provided by the user, and construct an initial set of candidate subgraphs;

[0041] S3: Use the search space and the set of candidate subgraphs as the input of the Grow-Cull execution model, expand the set of candidate subgraphs through the Grow operation to obtain an intermediate subgraph set, and then use the Cull operation on the set of intermediate subgraphs Qualified subgraphs are screened out to obtain a new...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a GPU-based high-performance graph mining method and system. The method comprises the steps: employing a GPU & CPU cooperative computing architecture, carrying out the graph mining operation through multiple threads of a GPU, improving the search efficiency, and storing a large number of intermediate sub-graphs generated in a graph mining process through a CPU memory; describing a system architecture by combining a Grow-Cull execution model: in a system operation process, copying a part of sub-graphs to a GPU each time to execute a Grow operation, judging a relationshipbetween the sub-graphs and vertexes / edges, and copying the generated candidate sub-graphs to a CPU memory; in order to check the legality of the candidate sub-graphs, the CPU multithreading technology is used for executing the Cull operation to judge the candidate sub-graphs, the qualified sub-graphs are stored in the CPU main memory. The system repeats the iteration process. By referring to thethought of a pipeline, CPU calculation and GPU calculation can be executed at the same time during iteration, bidirectional copying of data can also be executed at the same time, and calculation and transmission delay is masked.

Description

technical field [0001] The invention relates to a GPU-based high-performance graph mining method and system. Background technique [0002] The graph data structure can express the relationship between entities very well, but the traditional data structure cannot express such relationship efficiently. Such advantages make graph data play a vital role in different fields such as transportation networks, social networks, human brain projects, and biological genes. With the development of the Internet, a large amount of graph data is generated in more and more fields, and the scale of these graph data is increasing year by year. Analyzing and processing these massive graph data is becoming more and more important. In addition, with the development of hardware, the computing power of computers is getting higher and higher, and devices including GPUs and FPGAs have appeared to assist CPU calculations. In recent years, some researchers have begun to use the computing power provi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F16/901G06F16/903
CPCG06F16/9024G06F16/903G06F2216/03Y02D10/00
Inventor 谭光明邵恩张春明段勃
Owner 中科院计算所西部高等技术研究院
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products