Non-blocking array-based algorithms for stacks and queues

Abstract

We present new non-blocking array-based shared stack and queue implementations. We sketch proofs of correctness and amortized time analyses for the algorithms. To the best of our knowledge, our stack algorithm is the first practical array-based one and it is the first time that bounded counter values are employed to implement a shared stack and queue. We verify the correctness of our algorithms by the Spin model checker and compare our algorithms to other algorithms experimentally. © 2009 Springer.