A method, device and server for orderly control and storage information of lock-free threads

Abstract

The invention relates to the technical field of data storage, and provides a method, device and server for orderly controlling and storing information by lock-free threads. The method includes: according to the non-release state of the shared storage node in the circular queue, calling the CAS instruction during the period when the focus thread in the at least two first threads stores the current data in the shared storage node; The release state is changed to the release state, and the release state is used to indicate that the second thread can read the current data; the second thread is allocated a shared storage node in the release state; according to the storage position of the shared storage node in the circular queue and the original cursor in the CAS instruction Consistency, update the original cursor with a single vector, so that the focus thread locks the shared storage node. In this way, the threads can be controlled to access data in an orderly manner, which overcomes the additional overhead of controlling the storage queue and improves the thread concurrency efficiency.

Description

technical field [0001] The invention relates to the technical field of data storage, in particular to a method and a device for controlling and storing information in a circular queue by a lock-free thread. Background technique [0002] In related technologies, in order to avoid data conflicts caused by threads of applications or operating systems reading and writing stored data from the storage queue at the same time, the thread is locked to control its serial read and write operations. After the lock is released, the suspended thread can be locked to read and write the stored data serially, which limits the concurrency efficiency of the storage queue, so it is obviously more efficient to use the lock-free thread method. [0003] In order to enable lock-free threads to read and write stored data in an orderly manner, there are blocking or non-blocking algorithms for storage queues, but they must ensure that concurrent threads access the same storage node synchronously (for ...

AI Technical Summary

Problems solved by technology

[0003] In order to enable lock-free threads to read and write stored data in an orderly manner, there are blocking or non-blocking algorithms for storage queues, but they must ensure that concurrent threads access the same storage node synchronously (for ease of description, hereinafter referred to as shared storage nodes) to maintain the integrity of the storage queue Respectively, by delaying the queue (such as: generating and verifying additional unique codes) or restricting multi-threading to complete operations on shared storage nodes in the storage queue within limited steps (such as: adding virtual nodes and controlling their entry and exit), so that added overhead

[0004] In some cases, such as when more threads on the server need to frequently read and write storage nodes in the storage queue, the outstanding additional overhead will also reduce the concurrency efficiency

Images