Wait-free Synchronization
Wait-Free Synchronization is a synchronization primitive that guarantees every thread will complete its operation in a finite number of steps regardless of the execution speed or behavior of other threads.
37
Publications
4.4K
Citations
67
Authors
44
Institutions
Publications per year
2017–2026
2
Parents
37
Maurice Herlihy · ACM Transactions on Programming Languages and Systems · 1991 · 1.8K citations · Full text
ZooKeeper: wait-free coordination for internet-scale systems
P. G. Hunt, Mahadev Konar, Flavio Junqueira et al. · 2010 · 1.3K citations
Impossibility and universality results for wait-free synchronization
Maurice Herlihy · 1988 · 189 citations · Full text
Wait-free data structures in the asynchronous PRAM model
James Aspnes, Maurice Herlihy · 1990 · 114 citations
1–5 of 37
67
5
h-index
4
h-index
University of North Carolina at Chapel Hill, United States
4 publications · 188 citations
4
h-index
3
h-index
3
h-index
1–5 of 67
44

University of Toronto
Toronto, Canada
5 h-index
7 publications
194 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
3 h-index
4 publications
281 citations
Mitre (United States)
Bedford, United States
3 h-index
3 publications
42 citations
University of Pittsburgh
Pittsburgh, United States
3 h-index
3 publications
58 citations
Virginia Tech
Blacksburg, United States
3 h-index
4 publications
56 citations
Université de Rennes
Rennes, France
2 h-index
2 publications
44 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
303 citations
Technische Universität Dresden
Dresden, Germany
2 h-index
5 publications
151 citations
1–8 of 44
4 publications · 95 citations
4
h-index
JACM · 2 publications · 149 citations
2
h-index
TDSC · 1 publications · 21 citations
1
h-index
1 publications · 117 citations
1
h-index
1 publications · 70 citations
1
h-index
1–5