Many nonblocking algorithms have been proposed for shared queues.
Previous studies indicate that link-based algorithms perform best.
Employing such a mechanism incurs significant overheads, and consequently the link-based queues may not perform as well as claimed. A new nonblocking queue algorithm based on a finite array is proposed in this paper. Comparing with the link-based algorithms, the new algorithm provides the same degree of concurrency without being subject to the memory problem, hence suggests a good performance. Inc. All rights reserved.