Method for achieving unlocked concurrence message processing mechanism

Abstract

The invention discloses a method for achieving an unlocked concurrence message processing mechanism. An annular array is used as a data buffering area, caching and pre-reading can be facilitated, meanwhile, the defect that memory needs to be applied or released at each node operation caused by a chain table structure is overcome, and the efficiency is improved. In order to solve the concurrence control problem of a multiple-producer and single-consumer mode, a CAS and a memory barrier are used for guaranteeing mutual exclusion, a locking mode is not used, and performance deterioration caused by low efficiency of locking is avoided. In order to solve the common ABA problem in the unlocked technology, a double-insurance CAS technology is used for avoiding the occurrence of the ABA problem. In order to solve the false sharing problem, the method that cache lines are filled between a head pointer, a tail pointer and capacity is used for avoiding the false sharing problem due to the fact that the head pointer, the tail pointer and the capacity are in the same cache line. Meanwhile, the length of the array is set to be the index times of two, the bit operation of 'and operation' is used for acquiring the subscript of the array, and the overall efficiency is improved.

Description

[0001] technical field [0002] The invention belongs to the technical field of computer software engineering, and relates to a method for realizing a lock-free concurrent message processing mechanism. [0003] Background technique [0004] In a message-driven system, the message processing mechanism is the focus and difficulty of the system, and the quality of the message processing mechanism affects the stability and efficiency of the entire system. [0005] Existing message processing mechanisms are generally implemented based on queues (implemented by linked lists) and lock algorithms. The message queue is stored in a linked list structure. For multi-threaded operations on shared data, semaphores and locks are used to solve synchronization and mutual exclusion problems. [0006] There are several points in the existing mechanism that have a great impact on performance: [0007] (1) The linked list nodes are scattered and not in the same storage area, which is not con...

AI Technical Summary

Problems solved by technology

[0007] (1) The linked list nodes are scattered and not in the same storage area, which is not conducive to cache pre-reading

[0008] (2) Linked list nodes need to apply for or release memory every time they operate, which is relatively inefficient

[0009] (3) The customary programming method causes the three variables of head pointer, tail pointer and capacity to be in one cache line, causing false sharing problems

[0010] (4) A large number of lock operations cause inefficiency

Images