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, the producer pushing, the receiver poping. - When the queue is empty, I want the consumer to block to the queue, waiting for the producer. My first idea was to use a `LinkedBlockingQueue`, but I soon realized that it is not concurrent and the performance suffered. On the other hand, I now use a `ConcurrentLinkedQueue`, but still I am paying the cost of `wait()` / `notify()` on each publication. Since the consumer, upon finding an empty queue, does not block, I have to synchronize and `wait()` on a lock. On the other part, the producer has to get that lock and `notify()` upon every single publication. The overall result is that I am paying the cost of `sycnhronized (lock) {lock.notify()}` in every single publication, even when not needed. What I guess is needed here, is a queue that is both blocking and concurrent. I imagine a `push()` operation to work as in `ConcurrentLinkedQueue`, with an extra `notify()` to the object when the pushed element is the first in the list. Such a check I consider to already exist in the `ConcurrentLinkedQueue`, as pushing requires connecting with the next element. Thus, this would be much faster than synchronizing every time on the external lock. Is something like this available/reasonable?