Volatile or synchronized for primitive type?

前端 未结 5 1514
栀梦
栀梦 2021-02-04 06:52

In Java, assignment is atomic if the size of the variable is less than or equal to 32 bits but is not if more than 32 bits.

What (volatile/synchronized) would be more ef

相关标签:
5条回答
  • 2021-02-04 07:16

    According to the oracle documentation, you can use volatile to refer to Double object:

    volatile Double x = y;
    

    "Writes to and reads of references are always atomic, regardless of whether they are implemented as 32-bit or 64-bit values."

    0 讨论(0)
  • 2021-02-04 07:20

    KDSRathore, you can use some explicit locks, or make some dummy Object object = new Object() , on which you synchronize in setter/getter of that double

    0 讨论(0)
  • 2021-02-04 07:31

    If you find locking on the object itself too heavy, then synchronized is the way to go. Prior to Java 1.5 volatile may have been a good choice, but now volatile can have a very large impact by forcing instruction ordering on the method where the assignment happens. Create a separate object (private final Object X_LOCK = new Object();) and synchronize on it when setting or getting the value of that double. This will give you a fine level of control over the locking, which it seems that you need.

    In the new concurrency package there are more options, such as AtomicReference which may be a good replacement for volatile if you really need to avoid synchronization.

    0 讨论(0)
  • 2021-02-04 07:32

    What are you trying to do? The synchronized and volatile keywords are mechanisms in Java which can be used to ensure that consistent values are observed by different threads reading the same data. In particular they allow you to reason about happens-before relations in your programs.

    You simply cannot avoid using one of volatile or synchronized in order to properly access non-final fields in a multi-threaded program. That said, the main reason that you are likely to require synchronized over volatile is the requirement for using atomic compare and set operations (i.e. it will not be any performance consideration). For example, in a multi-threaded program:

    volatile int i = 0;
    
    public void foo() { 
        if (i == 0) i = i + 1;
    }
    

    The above code is inherently unsafe, even though the variable's declaration as being volatile means that reads and writes are flushed to main memory - the only safe implementation of such a method would be something like:

    int i = 0;
    
    public synchronized void foo() {
        if (i == 0) i = i + 1;
    }
    

    So which should you prefer? Well, if you have multiple threads modifying a field dependent on that field's value (i.e. compare-and set), then synchronized is the only safe solution.

    It's also worth saying: the performance overhead of synchronized is not a problem (in the overwhelming majority of cases). Synchronization-performance issues are usually due to unnecessary code bottlenecks, deadlocks or livelocks and can be mitigated if necessary. Any pure clock-cycles overhead will be dwarfed by other things you application does: file IO, database queries, remoting etc.

    0 讨论(0)
  • 2021-02-04 07:35

    volatile is certainly the way to go if you are only doing an assignment. I'm sure you know, but since it was brought up: if you would like to do more complex operations (increment the value for example) you would need to syncrhonize. i++ is never thread safe for any type of variable. You need to synch. i++ and the like since that is actually more than 1 operation.

    Not: It was expressed that you could use AtomicDouble but there is currently no AtomicDouble in java.util.concurrent.atomic

    If you are doing a multiple operations on x, that requires setting it to a new value at the end, it is possible to do this in a thread safe manner with no locking what so ever, and have it be thread safe, using compare and set. Example:

    AtomicLong x = new AtomicLong(SomeValue);
    public void doStuff() {
      double oldX;
      double newX;
      do {
        oldX = x.get();
        newX = calculateNewX(oldX);
      } while (!x.compareAndSet
          (Double.doubleToLongBits(oldX), Double.doubleToLongBits(newX)));
    

    This works because compareAndSet will see if the value of x has changed since the last time you read it. If x has changed then you are forced to do the computation over again and re-try setting it.

    You could of course implement your own AtomicDouble instead of doing these doubleToLongBits conversions. Take a look at AtomicFieldUpdater.

    0 讨论(0)
提交回复
热议问题