A queue data control method, system and queue data structure

Abstract

The application discloses a queue data control method, including: setting a circular queue, the circular queue includes at least one address, and the address is used to store elements; setting an insert failure counter, which is used to record the address where the element fails to be inserted in the circular queue; The counter is used to record the address of the failure to remove the element in the circular queue; set the operation lock of the insertion failure counter and the operation lock of the removal failure counter; when performing enqueue operation, if there is a record of the failure to remove the element in the removal failure counter, lock the removal The operation lock of the failure counter, after deleting the record of the failed event of extracting the element, release the operation lock of the failed counter of extracting, and reacquire the tail pointer of the queue; when performing the dequeue operation, if there is a record of the failed event of inserting the element in the insertion failure counter, lock the insertion The operation lock of the failure counter, after deleting the record of the failure event of inserting the element, releases the operation lock of the failure counter operation of the insertion failure, and reacquires the queue head pointer.

Description

technical field [0001] The present application belongs to the field of computer technology, and in particular relates to a queue data control method, system and queue data structure. Background technique [0002] A concurrent program refers to a program composed of several program modules that can be executed at the same time, and such program modules that can be executed at the same time are called threads. Multiple threads that make up a program can execute concurrently on multiple processors at the same time, and can also execute interactively on a single processor. Multiple threads can communicate with each other by reading and writing shared data areas or sending messages, so as to cooperate with each other to complete tasks. The multi-threaded execution method can greatly shorten the execution time of the program and improve the operating efficiency of the computer. [0003] However, the most prominent problem in multithreaded programs is data synchronization. When ...

AI Technical Summary

Problems solved by technology

[0008] However, the implementation of the lock-free queue above still has some problems that affect performance

For example, creating / recycling linked list nodes adds a lot of memory operations, which are not friendly to garbage collection in some languages; frequently exchanging head and / or tail count information between producers and consumers has an impact on performance, and , some adjustments made to improve tail performance do not support non-blocking operations

Images