Open computing language (OpenCL)-based red-black tree acceleration algorithm

A red-black tree and algorithm technology, applied in computing, special data processing applications, instruments, etc., can solve the problems of time-consuming red-black trees and large computing time, and achieve a large amount of calculation, shortened tree-building time, and rapid establishment. Effect
CN104036141AInactive Publication Date: 2014-09-10SHANGHAI UNIV
2 Cites 5 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
SHANGHAI UNIV
Publication Date
2014-09-10
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses an open computing language (OpenCL)-based red-black tree acceleration algorithm. The method includes that according to the characteristic that multiple calculations are capable of being parallel processed during establishing the red-black tree, an OpenCL heterogeneous platform is adopted to rapidly establish a red-black tree model on the basis of big data; with an idea of employing graphics processing unit (GPU) acceleration, to-be-operated data are divided into multiple data blocks, and multiple cores enter a data insertion operation at the same time by the GPU; and after operations of all GPUs are synchronized, by means of a merge operation, the whole red-black tree is established. The OpenCL-based red-black tree acceleration algorithm has the advantages that in the situation of the big data, the red-black tree is rapid to be established within a short time.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of GPU-based parallel computing, in particular to an OpenCL-based red-black tree acceleration algorithm. Background technique

[0002] A red-black tree is a self-balancing binary search tree. Its typical use is to implement associative arrays, and it can also be used for retrieval of large data. It is complex, but its operations have good worst-case running times, and are efficient in practice: it can do lookup, insertion, and deletion in O(log n) time, where n is the element in the tree Number of. A red-black tree is a binary search tree in which each node has a color attribute, either red or black. Its statistical performance is better than that of balanced binary trees, so red-black trees are used in many places. In C++ STL, many parts (currently including set, multiset, map, multimap) apply variants of red-black trees.

[0003] The present invention adopts a red-black tree acceleration algorithm based on OpenC...

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