Skip to main content

What is the diffrence between "volatile" and "synchronized" keywords?

Volatile keyword is thought of as an easy form of synchronized. It require less coding than synchronized and frequently have less run-time overhead.

When we talk about locks, 2 main features introduce:
i.) mutual exclusion which means only one thread at a time can hold a given lock, and
ii.) visibility which ensures that changes mode to shared data before releasing the lock are accessible to another thread that subsequently acquires the lock.

Comparing the volatile keyword with synchronized, the volatile is a field modifier while synchronized is used with code blocks and methods.

Let's clear one more point here. Threads can have local copies of variables/data which don't have to be the same as the data held in other threads. In fact, java has an idea of a MAIN memory which holds the current value for variables. And threads can have their own copy of variables which can be different from the main memory. And it's possible that suppose you have a variable named X which value is 1 for thread1 and 2 for thread2 but these values are not distributed to main memory or other threads.

So, using "volatile" does not allow to have a local copy of a variable that is different from the value currently held in main memory. Whenever you access or update the volatile variable in any thread, its value is visible to all other threads immediately.

But when using "synchronized" which firstly obtains and releases locks on monitors can force only one thread a time to execute a code block, if both threads use the same monitor (lock). It also synchronizes memory.

However, the volatile only synchronizes the value of one variable between thread memory and "main" memory, the synchronized synchronizes the value of all variables between thread memory and "main" memory and handles locks (acquire/release) and have more overhead than volatile.

In java, an increment (i.e. ++) and similar operations are not atomic. Hence, incrementing a volatile variable is not thread-safe and to achieve it, you have to use the synchronized keyword.

To conclude, using volatile is easy and simple as well as unlike locks don't cause a thread to block, so they are less likely to cause scalability issues.

Comments

Popular posts from this blog

Java Health Center - Overview and Features

This video highlights the features available in Health Center. Health Center is a low-processor and memory usage diagnostic tool for monitoring the status of a running IBM Java Virtual Machine (JVM). Health Center provides live information and recommendations in each of the following areas: - Classes: information about classes being loaded - Environment: details of the configuration and system of the monitored application - Garbage Collection: information about the Java heap and pause times - Locking: information about contention on inflated locks - Profiling: sampling profile of Java methods including call paths

WebSphere MQ Interview Questions

What is MQ and what does it do? Ans. MQ stands for MESSAGE QUEUEING. WebSphere MQ allows application programs to use message queuing to participate in message-driven processing. Application programs can communicate across different platforms by using the appropriate message queuing software products. What is Message driven process? Ans . When messages arrive on a queue, they can automatically start an application using triggering. If necessary, the applications can be stopped when the message (or messages) have been processed. What are advantages of the MQ? Ans. 1. Integration. 2. Asynchrony 3. Assured Delivery 4. Scalability. How does it support the Integration? Ans. Because the MQ is independent of the Operating System you use i.e. it may be Windows, Solaris,AIX.It is independent of the protocol (i.e. TCP/IP, LU6.2, SNA, NetBIOS, UDP).It is not required that both the sender and receiver should be running on the same platform What is Asynchrony? Ans. With messag...

Java Garbage Collection

Explain Garbage collection mechanism in Java? Garbage collection is one of the most important features of Java. The purpose of garbage collection is to identify and discard objects that are no longer needed by a program so that their resources can be reclaimed and reused. A Java object is subject to garbage collection when it becomes unreachable to the program in which it is used. Garbage collection is also called automatic memory management as JVM automatically removes the unused variables/objects (value is null) from the memory. Every class inherits finalize() method from java.lang.Object, the finalize() method is called by garbage collector when it determines no more references to the object exists. In Java, it is good idea to explicitly assign null into a variable when no more in use. In Java on calling System.gc() and Runtime.gc(), JVM tries to recycle the unused objects, but there is no guarantee when all the objects will garbage collected. Garbage collection is an automatic pro...