CAS explanation:
CAS (compare and swap), compare and swap. A mechanism that can solve the performance loss caused by using locks in multi-thread parallel situations. The CAS operation contains three operands—memory location (V), expected original value (A) and new value (B). If the value of a memory location matches the expected original value, the processor automatically updates the location to the new value. Otherwise, the processor does nothing. A thread gets the num value from the main memory and operates on num. When writing the value, the thread will compare the first num value obtained with the num value in the main memory. If they are equal, the changed value will be num is written into the main memory. If they are not equal, the comparison will be looped until successful.
CAS generation:
The volatile keyword is often used when modifying shared variables, but the volatile value has visibility and prohibits instruction reshooting (orderliness), and atomicity cannot be guaranteed. Although there is no problem in single thread, various problems will occur in multi-threading, causing on-site insecurity. Therefore, CAS was produced after jdk1.5 and uses CPU primitives (indivisible, continuous and uninterrupted) to ensure the atomicity of on-site operations.
CAS application:
The new java.util.concurrent(JUC) in JDK1.5 is built on CAS. Compared with the synchronized lock mechanism, CAS is a common implementation of non-blocking algorithms. Therefore, JUC has greatly improved its performance.
For example, the AtomicInteger class, AtomicInteger is thread-safe, the following is the source code
Enter unsafe and see do while Self-looping, the self-looping here is to judge that if the expected original value does not match the original value, it will recycle to get the original value, and then go through the CAS process until the new value can be assigned successfully.
CAS Advantages
cas is an optimistic locking idea, and it is a non-blocking lightweight optimistic lock. Non-blocking means that the failure or suspension of a thread will not Algorithms that should affect other threads' failures or hangs.
CAS Disadvantages
The cycle time is long, the overhead is large, and it takes up CPU resources. If the spin lock fails for a long time, it will bring a lot of overhead to the CPU. If the JVM can support the pause instruction provided by the processor, the efficiency will be improved to a certain extent. The pause instruction has two functions. First, it can delay the pipeline execution instruction (de-pipeline) so that the CPU does not consume too much execution resources. The amount of delay depends on the implementation, and on some processors the delay is zero. Secondly, it can avoid the CPU pipeline flush caused by memory order violation when exiting the loop, thereby improving the execution efficiency of the CPU.
Only atomic operations on a shared variable can be guaranteed. When performing an operation on a shared variable, we can use cyclic CAS to ensure atomic operations. However, when operating on multiple shared variables, cyclic CAS cannot guarantee the atomicity of the operation. In this case, you can use a lock, or have a The trick is to merge multiple shared variables into one shared variable for operation. For example, there are two shared variables i=2, j=a, merge ij=2a, and then use CAS to operate ij. Starting from Java 1.5, JDK provides the AtomicReference class to ensure the atomicity between reference objects. You can put multiple variables in one object to perform CAS operations.
ABA problem
Solving the ABA problem (if the value is to consider the ending, you can ignore the problem without considering the process)
Add version number
AtomicStampedReference
Provided in the atomic package of JDK starting from Java1.5 A class AtomicStampedReference is created to solve the ABA problem. The compareAndSet method of this class is to first check whether the current reference is equal to the expected reference, and whether the current flag is equal to the expected flag. If all are equal, then atomically set the value of the reference and the flag to the given update value.
Timing of using CAS
If the number of threads is small and the waiting time is short, spin lock can be used for CAS to try to get the lock, which is more efficient than synchronized.
The number of threads is large and the waiting time is long. It is not recommended to use spin locks and consumes a lot of CPU
The above is the detailed content of How to apply CAS in java. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

There are three common methods to traverse Map in Java: 1. Use entrySet to obtain keys and values at the same time, which is suitable for most scenarios; 2. Use keySet or values to traverse keys or values respectively; 3. Use Java8's forEach to simplify the code structure. entrySet returns a Set set containing all key-value pairs, and each loop gets the Map.Entry object, suitable for frequent access to keys and values; if only keys or values are required, you can call keySet() or values() respectively, or you can get the value through map.get(key) when traversing the keys; Java 8 can use forEach((key,value)->

In Java, Comparable is used to define default sorting rules internally, and Comparator is used to define multiple sorting logic externally. 1.Comparable is an interface implemented by the class itself. It defines the natural order by rewriting the compareTo() method. It is suitable for classes with fixed and most commonly used sorting methods, such as String or Integer. 2. Comparator is an externally defined functional interface, implemented through the compare() method, suitable for situations where multiple sorting methods are required for the same class, the class source code cannot be modified, or the sorting logic is often changed. The difference between the two is that Comparable can only define a sorting logic and needs to modify the class itself, while Compar

To deal with character encoding problems in Java, the key is to clearly specify the encoding used at each step. 1. Always specify encoding when reading and writing text, use InputStreamReader and OutputStreamWriter and pass in an explicit character set to avoid relying on system default encoding. 2. Make sure both ends are consistent when processing strings on the network boundary, set the correct Content-Type header and explicitly specify the encoding with the library. 3. Use String.getBytes() and newString(byte[]) with caution, and always manually specify StandardCharsets.UTF_8 to avoid data corruption caused by platform differences. In short, by

std::chrono is used in C to process time, including obtaining the current time, measuring execution time, operation time point and duration, and formatting analysis time. 1. Use std::chrono::system_clock::now() to obtain the current time, which can be converted into a readable string, but the system clock may not be monotonous; 2. Use std::chrono::steady_clock to measure the execution time to ensure monotony, and convert it into milliseconds, seconds and other units through duration_cast; 3. Time point (time_point) and duration (duration) can be interoperable, but attention should be paid to unit compatibility and clock epoch (epoch)

HashMap implements key-value pair storage through hash tables in Java, and its core lies in quickly positioning data locations. 1. First use the hashCode() method of the key to generate a hash value and convert it into an array index through bit operations; 2. Different objects may generate the same hash value, resulting in conflicts. At this time, the node is mounted in the form of a linked list. After JDK8, the linked list is too long (default length 8) and it will be converted to a red and black tree to improve efficiency; 3. When using a custom class as a key, the equals() and hashCode() methods must be rewritten; 4. HashMap dynamically expands capacity. When the number of elements exceeds the capacity and multiplies by the load factor (default 0.75), expand and rehash; 5. HashMap is not thread-safe, and Concu should be used in multithreaded

JavaScript data types are divided into primitive types and reference types. Primitive types include string, number, boolean, null, undefined, and symbol. The values are immutable and copies are copied when assigning values, so they do not affect each other; reference types such as objects, arrays and functions store memory addresses, and variables pointing to the same object will affect each other. Typeof and instanceof can be used to determine types, but pay attention to the historical issues of typeofnull. Understanding these two types of differences can help write more stable and reliable code.

InJava,thestatickeywordmeansamemberbelongstotheclassitself,nottoinstances.Staticvariablesaresharedacrossallinstancesandaccessedwithoutobjectcreation,usefulforglobaltrackingorconstants.Staticmethodsoperateattheclasslevel,cannotaccessnon-staticmembers,

ReentrantLock provides more flexible thread control in Java than synchronized. 1. It supports non-blocking acquisition locks (tryLock()), lock acquisition with timeout (tryLock(longtimeout, TimeUnitunit)) and interruptible wait locks; 2. Allows fair locks to avoid thread hunger; 3. Supports multiple condition variables to achieve a more refined wait/notification mechanism; 4. Need to manually release the lock, unlock() must be called in finally blocks to avoid resource leakage; 5. It is suitable for scenarios that require advanced synchronization control, such as custom synchronization tools or complex concurrent structures, but synchro is still recommended for simple mutual exclusion requirements.
