Operation method of hash table

Abstract

The invention relates to a method for operating a Hash table, in particular to a method for operating the hash table under a master-slave mode parallel polynuclear processor system. The invention aims at providing a method for operating the Hash table, which can efficiently carry out operations such as establishment, inserting and the like to the Hash table and enables the operations of the Hash table not to affect the Hash table search performance. The method comprises the following steps: carrying out table establishment and memory allocation operations in Hash table management on a main nucleus, and carrying out the search, inserting, deletion and updating operations of the Hash table on each nucleus which establishes the Hash table, wherein the operations can be finished in one thread or task, the table establishment operation comprises: operating on the main nucleus, and establishing a sheet of Hash table for each nucleus which needs establishing the table, and the memory allocation comprises: allocating demanded internal memory for nodes which are corresponding to each Hash table total table entry number by the main nucleus and linking the internal memory nodes through a linked list. The method is suitable for the master-slave mode parallel polynuclear processor system.

Description

technical field [0001] The invention relates to a method for operating a hash table, in particular to a method for operating a hash table under a master-slave parallel multi-core processor system. Background technique [0002] Hash table (Hash) table is often used to store key data because of its simple structure and fast search speed, and it can easily replace the Hash algorithm. The Hash table is generally organized as an array plus a doubly linked list structure, where the linked list is used as a Hash bucket to resolve Hash conflicts. [0003] The management of the Hash table involves operations such as creation, insertion, deletion, and update. Because the Hash table is used to store key data, the lookup performance is a key indicator, and the faster the better, so the different operation methods of the Hash table management have different impacts on the lookup performance of the Hash table. [0004] In a multi-core processor system with a master-slave structure of sh...

AI Technical Summary

Problems solved by technology

If each core uses its own table, but the management is still on one core, the search operation is performed on each core, which also involves data protection issues, thus affecting search performance

If each core uses its own table, management and search are performed only on its own core, each core is required to have a memory management function, which is not applicable to some master-slave multi-core processor systems

Images