Compare-and-swap
Compare-And-Swap is a synchronization primitive that atomically compares the value stored at a memory location with an expected value and, if they match, updates the memory location with a new value, thereby enabling thread-safe manipulation of shared data in concurrent systems.
60
Publications
3.3K
Citations
111
Authors
48
Institutions
Publications per year
2017–2026
12
Parents
60
Lock-free linked lists using compare-and-swap
John D. Valois · 1995 · 290 citations
Concurrent programming without locks
Keir Fraser, Tim Harris · ACM Transactions on Computer Systems · 2007 · 260 citations
Non-blocking binary search trees
Faith Ellen, Panagiota Fatourou, Eric Ruppert et al. · 2010 · 190 citations
Ori Shalev, Nir Shavit · Journal of the ACM · 2006 · 182 citations
Fast concurrent queues for x86 processors
Adam Morrison, Yehuda Afek · 2013 · 144 citations
1–5 of 60
111
6
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 111
48

Tel Aviv University
Tel Aviv, Israel
6 h-index
11 publications
881 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
6 h-index
9 publications
739 citations

University of Waterloo
Waterloo, Canada
5 h-index
5 publications
320 citations
Microsoft (United States)
Redmond, United States
5 h-index
9 publications
289 citations

University of Toronto
Toronto, Canada
5 h-index
6 publications
410 citations

York University
Toronto, Canada
5 h-index
6 publications
521 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
5 publications
375 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
4 publications
261 citations
1–8 of 48
3 publications · 72 citations
3
h-index
1 publications · 74 citations
1
h-index
TOCS · 1 publications · 260 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
Repository · 1 publications · 11 citations
1
h-index
1–5