title: Java: ArrayBlockingQueue vs. LinkedBlockingQueue
body: <p>I think that, in most cases, the <code>ArrayBlockingQueue</code> will perform better than the <code>LinkedBlockingQueue</code>. However, that is the case when there is always enough room in the array... If it gets full, it's not very predictable whether it will perform so well, since it will block the thread that's trying to push data into the queue...</p>
  
  <p>So, my question is: Is there any middle-ground implementation of <code>BlockingQueue</code>? Say, an <code>ArrayListBlockingQueue</code> or a <code>BucketListBlockingQueue</code>? Something like a list of arrays, so that the queue can increase in capacity dynamically, while still having a reasonable benefit from using array to ultimately store data?</p>