Nonblocking Algorithms
Nonblocking Algorithms is a synchronization method that ensures progress for at least one thread in a system without relying on locks, thereby preventing blocking hazards such as deadlocks, livelocks, or priority inversion.
57
Publications
3.4K
Citations
105
Authors
70
Institutions
Publications per year
2017–2026
1
Variants
Non-blocking Algorithms
Parents
57
Practical implementations of non-blocking synchronization primitives
1–5 of 57
105
8
h-index
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 105
70

Poznań University of Technology
Poznan, Poland
4 h-index
12 publications
158 citations

Tel Aviv University
Tel Aviv, Israel
4 h-index
6 publications
393 citations

University of Rochester
Rochester, United States
4 h-index
8 publications
2.1K citations
Brown University
Providence, United States
3 h-index
3 publications
514 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
3 h-index
7 publications
183 citations
University of Pittsburgh
Pittsburgh, United States
3 h-index
3 publications
184 citations

Victoria University of Wellington
Wellington, New Zealand
2 h-index
4 publications
252 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
4 publications
71 citations
1–8 of 70
3 publications · 136 citations
3
h-index
3 publications · 78 citations
3
h-index
3 publications · 139 citations
3
h-index
2 publications · 100 citations
2
h-index
2 publications · 69 citations
2
h-index
1–5