Research And Application Of High Concurrent Lock-free Scheduling Algorithms For Protocol Stack Software

The traditional multi-threading mechanism has poor performance.The data synchronization method is based on thread locks to avoid resource competition.In a concurrent environment,thread locks can protect shared data,so that limited resources in computer systems can be safely and orderly accessed.At present,the mainstream method for communication and synchronization of multiple threads of protocol stack software is to use various thread locks for data synchronization.However,lock-based synchronization is often accompanied by serious shortcomings.The specific manifestation is that thread locks will bring a high degree of competition for resources.It is exclusive when preempting resources.Only one thread at a time has the right to use resources in a critical section.This way of waiting for resources to run serially makes the program run very inefficiently,and even all threads wait for each other's resources occupied by other threads in the system without any thread actively giving up the deadlock that takes up resources.Aiming at the problem of large delay overhead under the multi-thread communication mechanism of the traditional protocol stack software system,which causes its low operating efficiency,this paper proposes a secure and efficient lock-free data structure adapted to the protocol stack software N-BASE platform,This paper proposes a scheme for optimizing the scheduling strategy under the lock-free mechanism,which greatly improves the performance of the protocol stack software under high concurrency.The article mainly discusses:(1)Contrasting and analyzing the advantages and disadvantages of different lock-free data structures,combined with the characteristics of protocol stack software,this paper proposes a new lock-free concurrent data structure,analyzes its algorithm principle and working mechanism,and proves the correct algorithm.(2)In view of the data synchronization problem under the lock-free mechanism,combined with the principle of spatial locality and the idea of circular dynamic array,the efficient and lock-free communication mechanism for concurrent data structures is avoided.The mutual exclusion overhead caused by accessing shared queues in a multi-threaded environment.(3)This paper proposes an optimization scheme for the scheduling strategy of the N-BASE platform under the lock-free mechanism.At the system level,it explains the algorithm implementation of multiple threads to efficiently and orderly complete the thread communication under the lock-free mechanism.