Sciweavers

Share
SPAA
2004
ACM

A scalable lock-free stack algorithm

9 years 1 months ago
A scalable lock-free stack algorithm
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blocking, and the elimination trees are non-blocking but not linearizable. Neither is used in practice since they perform well only at exceptionally high loads. The literature also describes a simple lock-free linearizable stack algorithm that works at low loads but does not scale as the load increases. The question of designing a stack algorithm that is non-blocking, linearizable, and scales well throughout the concurrency range, has thus remained open. This paper presents such a concurrent stack algorithm. It is based on the following simple observation: that a single elimination array used as a backoff scheme for a simple lock-free stack is lock-free, linearizable, and scalable. As our empirical results show, the resulting elimination-backoff stack performs as well as the simple stack at low loads, and increasi...
Danny Hendler, Nir Shavit, Lena Yerushalmi
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where SPAA
Authors Danny Hendler, Nir Shavit, Lena Yerushalmi
Comments (0)
books