Cache coloring memory allocation method and device for search tree

Abstract

The embodiment of the invention provides a cache-coloring memory allocation method and device for search trees. The method includes: constructing the first search tree; determining that the first search tree has N layers of nodes; acquiring the number of the nodes which each layer in the N layers of nodes has; allocating corresponding colors in coloring colors of a memory for each layer of nodes according to the number of the nodes which each layer in the N layers of nodes has, wherein the corresponding colors allocated for all the layers of nodes are mutually different; and generating the second search tree after cache coloring according to the colors corresponding to each layer of nodes and the memory corresponding to the colors. Only the memory which can be mapped to the corresponding coloring colors is allocated when the memory is allocated for each layer of nodes according to the colors corresponding to each layer of nodes in the second search tree, mapping relationships exist between the memory and a Cache, thus an effect that the different layers of nodes cannot mutually compete for the Cache can be guaranteed, and thus search performance is improved.

Description

technical field [0001] Embodiments of the present invention relate to the field of storage technologies, and in particular, to a cache coloring memory allocation method and device for a search tree. Background technique [0002] In the hierarchical storage structure of modern computers, Cache is a layer of cache located between main memory and CPU registers. Cache is usually composed of SRAM with small capacity and fast speed. By caching the hot data required by CPU, it can reduce the CPU's access to main memory, improve the efficiency of memory access, and make up for the gap between CPU computing speed and main memory access speed. , which is conducive to improving the overall performance of the computer system. In order to reduce the overhead of data exchange between main memory and Cache, and make full use of the spatial locality (Spatial Locality) of computer programs, the unit of data exchange between Cache and main memory is usually a Cache line consisting of multipl...

AI Technical Summary

Problems solved by technology

Since the capacity of the Cache is often much smaller than that of the main memory, all the data in the main memory cannot be cached in the Cache at the same time. When there is a new Cache Line in the main memory that needs to be cached in the Cache, all the locations that can cache the Cache Line are all deleted. When it is occupied, it is necessary to replace the Cache Line in a certain position and leave a free position to cache the new Cache Line; therefore, the performance of data search is degraded

Images