Home/ Questions/Q 7796749
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-01T23:27:53+00:00

This is the description of the documentation of ConcurrentLinkedQueue : An unbounded thread-safe queue

  • 0

This is the description of the documentation of ConcurrentLinkedQueue:

An unbounded thread-safe queue based on linked nodes. This queue orders elements FIFO (first-in-first-out).
…
This implementation employs an efficient “wait-free” algorithm

Is it possible to be unbounded and wait-free?
I am pretty sure wait-freedom ensures a bound on any operation.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I am pretty sure wait-freedom ensures a bound on any operation.

    A bound on the time (or number of instructions, or whatever) taken by the operation.

    In that JavaDoc, "Unbounded" probably refers to the number of elements the queue may contain.

    For instance, the JavaDoc for LinkedBlockingDeque writes:

    An optionally-bounded blocking deque based on linked nodes.

    The optional capacity bound constructor argument serves as a way to prevent excessive expansion. The capacity, if unspecified, is equal to Integer.MAX_VALUE. Linked nodes are dynamically created upon each insertion unless this would bring the deque above capacity.

    • 0