spin manual

A Linux kernel spin lock design-relay nested stack-based spin locks and spin nestingThe overhead of the lock is huge, especially for multi-core and multi-core processing.Multi-processing is introduced to improve the performance of parallel

The cost of locking overhead locks is huge, especially for multicore multi-processing.The introduction of multi-processing, itself is to be parallelized processing to improve performance, however, because of the existence of a shared critical

Cost of LocksThe cost of locking is huge, especially for multicore multi-processing.The introduction of multi-processing, itself is to be parallelized processing to improve performance, however, because of the existence of a shared critical section,

the memory barrier, read-write spin lock and sequential lock of the lock mechanism in Linux kernelIn the previous blog post, I discussed the related content of atomic manipulation and spin locks, and this post will continue the discussion of locking

Read-Write Spin lock (Rwlock) is a spin lock mechanism with smaller spin-lock granularity, which retains the concept of "spin". However, in the write operation, there can be only one write process, in terms of reading, can have more than one

Features:1. No image, no external CSS2. No dependency (jquery supported, but not required)3. configurable height4. Resolution independence5. VML is supported when the earlier version of IE is not supported.6. Use the Key Frame Animation and

Features:1. No image, no external CSS2. No dependency (jQuery supported, but not required)3. configurable height4. Resolution independence5. VML is supported when the earlier version of IE is not supported.6. Use the Key Frame Animation and

　 In a multi-core system, multiple CPU cores compete for the same resource. Therefore, there must be some mechanisms to ensure that there will be no errors in the competition, that is, the synchronization mutex mechanism. This section mainly

Mutex synchronizationMutex Synchronization (Mutual Exclusion & synchronization) is a common method of concurrency correctness assurance. Synchronization is a child. When multiple threads concurrently access shared data, the shared data is guaranteed

Unlike sending network packets, network packets are asynchronous, because you are not sure who will send you a network packet suddenly, so this network packet logic actually contains two things: 1. Notification after the arrival of the packet2.