Concurrency basics · interview question
Which of the following statements about lock fairness in ReentrantLock is true?
Multiple choiceMediumchapter-15-curatedpremiumconcurrencysynchronized-and-locks
Answer and explanation
Correct answer
B. Fair mode reduces throughput by ensuring first-come-first-serve
Why
ReentrantLock can be instantiated in fair mode, which ensures that threads acquire locks in the order they are requested. However, this can reduce throughput as it might lead to more context switching, making it less efficient than the default unfair mode.
Test yourself on Concurrency basics
A free test with instant, explained results. No account needed.
More Concurrency basics questions
- How can you avoid deadlocks when using multiple ReentrantLocks in a method?
- What does the 'volatile' keyword guarantee in Java?
- Why might using 'volatile' alone be insufficient for ensuring thread safety when updating a shared counter?
- Consider the following code snippet. What issue might occur if 'flag' is not declared as 'volatile'?
- When using synchronized blocks, how can you ensure fairness among threads?
- How would you explain a common use case for 'volatile' variables in an interview?