Java BlockingQueue take() vs poll()

java concurrency queue blockingqueue
isapir picture isapir · Apr 30, 2014 · Viewed 34k times · Source

When consuming values from a Queue in an infinite loop -- what would be more efficient:

1) Blocking on the Queue until a value is available via take()

while (value = queue.take()) { doSomething(value); }

2) Sleeping for n milliseconds and checking if an item is available

while (true) {

    if ((value = queue.poll()) != null) { doSomething(value); }

    Thread.sleep(1000);
}

Answer

awksp picture awksp · Apr 30, 2014

Blocking is likely more efficient. In the background, the thread that initially calls take() goes to sleep if there is no element available, letting other threads do whatever they need to do. The methods that add elements to the Queue will then wake up waiting threads when an element is added, so minimal time is spent checking the queue over and over again for whether an element is available.

Related questions

Which concurrent Queue implementation should I use in Java?

From the JavaDocs: A ConcurrentLinkedQueue is an appropriate choice when many threads will share access to a common collection. This queue does not permit null elements. ArrayBlockingQueue is a classic "bounded buffer", in which a fixed-sized array holds elements inserted …

Read More
LinkedBlockingQueue vs ConcurrentLinkedQueue

My question relates to this question asked earlier. In situations where I am using a queue for communication between producer and consumer threads would people generally recommend using LinkedBlockingQueue or ConcurrentLinkedQueue? What are the advantages / disadvantages of using one over …

Read More
Concurrent and Blocking Queue in Java

I have the classic problem of a thread pushing events to the incoming queue of a second thread. Only this time, I am very interested about performance. What I want to achieve is: I want concurrent access to the queue, …

Read More