11 citations · 12 across the 2 of their papers we have counts for
3 papers
cs.DC2009
Supporting Lock-Free Composition of Concurrent Data Objects
Daniel Cederman, Philippas Tsigas
Lock-free data objects offer several advantages over their blocking counterparts, such as being immune to deadlocks and convoying and, more importantly, being highly concurrent. Bu…
cs.DC2008★ 1 cited
NB-FEB: An Easy-to-Use and Scalable Universal Synchronization Primitive for Parallel Programming
Phuong Hoai Ha, Philippas Tsigas, Otto J. Anshus
This paper addresses the problem of universal synchronization primitives that can support scalable thread synchronization for large-scale many-core architectures. The universal syn…
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…