Home/ Questions/Q 886001
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T12:59:59+00:00

We are developing a Java application with several worker threads. These threads will have

  • 0

We are developing a Java application with several worker threads. These threads will have to deliver a lot of computation results to our UI thread. The order in which the results are delivered does not matter.

Right now, all threads simply push their results onto a synchronized Stack – but this means that every thread must wait for the other threads before results can be delivered.

Is there a data structure that supports simultaneous insertions with each insertion completing in constant time?

Thanks,

Martin

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    ConcurrentLinkedQueue is designed for high contention. Producers enqueue stuff on one end and consumers collect elements at the other end, so everything will be processed in the order it’s added.

    ArrayBlockingQueue is a better for lower contention, with lower space overhead.

    Edit: Although that’s not what you asked for. Simultaneuos inserts? You may want to give every thread one output queue (say, an ArrayBlockingQueue) and then have the UI thread poll the separate queues. However, I’d think you’ll find one of the two above Queue implementations sufficient.

    • 0