Wait-free Programming
Wait-Free Programming is a concurrency control paradigm in thread programming where each method or operation is guaranteed to complete within a finite number of steps, irrespective of the execution speed or behavior of other threads, thereby ensuring progress and liveness for all participating processes.
41
Publications
3.2K
Citations
79
Authors
48
Institutions
Publications per year
2017–2026
3
Parents
41
ZooKeeper: wait-free coordination for internet-scale systems
P. G. Hunt, Mahadev Konar, Flavio Junqueira et al. · 2010 · 1.3K citations
Atomic snapshots of shared memory
Yehuda Afek, Hagit Attiya, Danny Dolev et al. · Journal of the ACM · 1993 · 453 citations · Full text
Yehuda Afek, Dalia Dauber, Dan Touitou · 1995 · 103 citations · Full text
1–5 of 41
79
University of North Carolina at Chapel Hill, United States
6 publications · 285 citations
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 79
48
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
8 publications
739 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
5 h-index
8 publications
442 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
7 publications
1.3K citations
Dartmouth College
Hanover, United States
3 h-index
4 publications
160 citations
Microsoft (United States)
Redmond, United States
3 h-index
4 publications
68 citations
AT&T (United States)
Bedminster, United States
3 h-index
4 publications
563 citations

Rice University
Houston, United States
3 h-index
7 publications
212 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
4 publications
745 citations
1–8 of 48
5 publications · 106 citations
5
h-index
JACM · 3 publications · 551 citations
3
h-index
2 publications · 42 citations
2
h-index
2 publications · 27 citations
2
h-index
TPDS · 2 publications · 81 citations
2
h-index
1–5