java - 无界无等待？

Question

这是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

是否有可能无限制 和无等待？
我很确定无等待确保有限制任何操作。

Answer 1

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

操作所用的时间(或指令数，或其他)的界限。

在该 JavaDoc 中，“无界”可能指的是队列可能包含的元素数。

例如，LinkedBlockingDeque 的 JavaDoc 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.