A scalable lock-free stack algorithm

Volume: 70, Issue: 1, Pages: 1 - 12
Published: Jan 1, 2010
Abstract
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...
Paper Details
Title
A scalable lock-free stack algorithm
Published Date
Jan 1, 2010
Volume
70
Issue
1
Pages
1 - 12
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.