11 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.DC2013★ 5 cited
Lock-free Concurrent Data Structures
Daniel Cederman, Anders Gidenstam, Phuong Ha +3
Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the progra…
cs.DC2004★ 11 cited
Lock-Free and Practical Deques using Single-Word Compare-And-Swap
Håkan Sundell, Philippas Tsigas
We present an efficient and practical lock-free implementation of a concurrent deque that is disjoint-parallel accessible and uses atomic primitives which are available in modern c…