Asynchronous graphic data processing system based on GPU

Abstract

The invention discloses an asynchronous graphic data processing system based on a GPU. The asynchronous graphic data processing system comprises achieving a combining coloring algorithm for changing an original single and heuristic coloring algorithm to the combining coloring algorithm; a data preprocessing strategy for changing an original preprocessing partition method based on a vertex degree to a mode based on vertex coloring distribution; and an asynchronous processing executing engine which changes the executing mode of a processing engine from a synchronous BSP mode to an asynchronous processing mode and achieve lockless asynchronous programming on the GPU in combination with a combining coloring algorithm module. In the asynchronous processing executing engine, an iteration processing module and a data flow executing module are achieved and the bandwidths and computing capabilities of a CPU and the GPU are managed and used in a unified manner. According to the graphic data processing system based on the GPU, the asynchronous processing executing engine may greatly accelerate graphic algorithm convergence and solve problems of synchronous waiting expense and asynchronous programming lock expense on the GPU so as to improve the graphic data processing capability of the GPU.

Description

technical field [0001] The invention belongs to the field of graph data processing and high-performance computing, and more specifically relates to a GPU-based asynchronous graph data processing system. Background technique [0002] Large-scale graph data processing is involved in more and more applications. Traditional stand-alone graph processing systems divide large-scale graph data and then process data blocks sequentially. Compared with the cumbersome programming of distributed systems, simple stand-alone systems have attracted more and more attention. The key to a stand-alone system is to solve problems such as poor disk access performance, low task concurrency, and low utilization of device memory bandwidth due to graph data partitioning. In the academic community, some active exploration and research have been carried out on such problems. try. [0003] The GraphChi system adopts the newly designed sliding window PSW (Parallel Sliding Window) algorithm, which divid...

AI Technical Summary

Problems solved by technology

[0008] In view of the low efficiency of the data division strategy of the current stand-alone graph processing system and the poor concurrency of graph vertex processing tasks, the present invention proposes a GPU-based asynchronous graph processing system that takes into account the data exchange overhead between the GPU device memory and the host memory problem, adopt a data partition strategy based on the mixed graph coloring algorithm, improve data concurrency, make full use of the powerful parallel processing capability of the GPU, and greatly improve the performance of single-machine graph processing

Images