Lock-free Algorithms
Lock-Free Algorithms is a concurrency control method that ensures system-wide progress by guaranteeing that at least one thread makes progress in a finite number of steps, distinguishing it from blocking and wait-free synchronization techniques through its non-reliance on locks and its avoidance of indefinite thread suspension.
135
Publications
13.5K
Citations
231
Authors
103
Institutions
Publications per year
2017–2026
20
135
HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Feng Niu, Benjamin Recht, Christopher Ré et al. · arXiv (Cornell University) · 2011 · 1.2K citations · Full text
1–5 of 135
231
13
h-index
9
h-index
8
h-index
8
h-index
6
h-index
1–5 of 231
103
Chalmers University of Technology
Gothenburg, Sweden
13 h-index
44 publications
1.3K citations
Technion – Israel Institute of Technology
Haifa, Israel
12 h-index
24 publications
952 citations

Tel Aviv University
Tel Aviv, Israel
7 h-index
13 publications
1.3K citations
Microsoft (United States)
Redmond, United States
6 h-index
8 publications
285 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
5 h-index
9 publications
310 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
5 h-index
11 publications
463 citations

Victoria University of Wellington
Wellington, New Zealand
5 h-index
7 publications
207 citations
University of Cambridge
Cambridge, United Kingdom
4 h-index
7 publications
238 citations
1–8 of 103
10 publications · 195 citations
10
h-index
4 publications · 345 citations
4
h-index
Repository · 3 publications · 1.3K citations
3
h-index
3 publications · 156 citations
3
h-index
Conference · 2 publications · 209 citations
2
h-index
1–5