Introduction
Use of volatile variables is common among Java developers as a way of implicit synchronization. JIT compilers may reorder program execution to increase performance. Java memory model[1] constraints reordering of volatile variables. Thus volatile variable access should has a cost which is different than a non-volatile variable access.This article will not discuss technical details on use of volatile variables. Performance impact of volatile variables is explored by using a test application.
Objective
Exploring volatile variable costs and comparing with alternative approaches.Audience
This article is written for developers who seek to have a view about cost of volatile variables.Test Configuration
Test application runs read and write actions on java variables. A non volatile primitive integer, a volatile primitive integer and an AtomicInteger is tested. Non-volatile primitive integer access is controlled with ReentrantLock and ReentrantReadWriteLock to compare with explicit locking schemes.A single test result is produced by doing 1 million read or write operations. Read and Write operations are conducted simultaneously. In some tests writing is excluded. In some tests 2 threads are used to read simultaneously.
For reliable results, each test is repeated 100 times for each variable type. Tests are run in the following order:
- Non-volatile Primitive Integer (Shared read/write)
- Non-volatile Primitive Integer with Reentrant Lock (Synch Read/Write)
- Non-volatile Primitive Integer with Reentrant ReadWrite Lock (RW Synch Read/Write)
- Volatile primitive integer (Volatile read/write)
- AtomicInteger (Atomic read/write)
At the and for each variable type 500 test results are generated.
Results
Average duration values are shown in y-axis. All values are in milliseconds. Please note that 500 test results are used for each variable and in each test a single thread made 1 million read or write operations. Results should be interpreted by considering thread counts and variable counts.1- No writer, single reader.
2- No writer, 2 readers.
3- 1 Writer, 1 Readers.
4- 1 Writer, 2 Readers.
5- 1 Reader, 2 Variables
Interpreting Results
Test 1 uses 1 thread to make read operations. No concurrent write is done. Access to volatile and non volatile variables have similar costs. Using locks to constraint access is very costly.Test 2 uses 2 threads to make concurrent reads. Results are not averaged by thread count. If we consider thread count, and divide results by 2, non volatile variable access is similar to Test 1, which is expected.
However, volatile and atomic variables have somewhat increased costs. Reentrant Lock cost increases, which is not surprising.
ReentrantReadWrite Lock cost increases much more than Reentrant Lock which is not expected. Expected results were close to the results of Test 1. Cost of ReentrantReadWrite Lock in all tests is not understandable. Curies readers my inspect test application code [2].
Test 3 uses 1 reader and 1 writer to inspect affect of changes. Non volatile variable access cost is similar to Test 2. Writing cost is slightly more costly compared to reading cost.Volatile reads still similar to non-volatile reads. Volatile writes however, now more than 2 times costlier than non-volatile writes. Atomic variables read cost is similar to volatile read costs. Atomic write cost is similar to volatile write cost.
If read and write costs are summed, Reentrant lock cost is found to be similar to test 2 costs. ReentrantReadWrite Lock costs are again high and not reasonable.
Test 4 adds one more reader to Test 3. Since there are two readers, divide results by 2 while interpreting. Non volatile and atomic operations are similar to results of Test 3.
Test 5 is the same setup with Test 1. Only difference is instead of 1 variable, 2 variables are used. This test aims to see if using two memory barrier is more costly than using single memory barrier through use of Locks. According to results, using locks is still more costly.
Conclusion
Volatile variables and Atomic variables are cheap ways of implicit synchronization.Use of locks should be avoided when possible.
References
1- Java Memory Model2- Test Application Source Code
Comments
Post a Comment