Scalable Locks
Scalable Locks is a synchronization primitive designed to minimize contention and overhead in concurrent systems by ensuring that lock acquisition and release times do not degrade significantly with increasing numbers of contending threads.
20
Publications
855
Citations
42
Authors
27
Institutions
Publications per year
2017–2026
3
Parents
20
David Dice, Virendra J. Marathe, Nir Shavit · 2012 · 104 citations
Scalable queue-based spin locks with timeout
Michael L. Scott, William N. Scherer · 2001 · 93 citations
Dave Dice, Virendra J. Marathe, Nir Shavit · 2011 · 71 citations
David Dice, Virendra J. Marathe, Nir Shavit · ACM Transactions on Parallel Computing · 2015 · 55 citations
1–5 of 20
42
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 42
27

University of Rochester
Rochester, United States
5 h-index
10 publications
382 citations
Oracle (United States)
Austin, United States
4 h-index
8 publications
512 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
133 citations

Data61
Sydney, Australia
2 h-index
5 publications
153 citations
IIT@MIT
Cambridge, United States
2 h-index
2 publications
126 citations

The University of Sydney
Sydney, Australia
2 h-index
2 publications
67 citations
Seoul National University
Seoul, South Korea
2 h-index
2 publications
67 citations
Argonne National Laboratory
Lemont, United States
1 h-index
3 publications
51 citations
1–8 of 27
2 publications · 35 citations
2
h-index
TOPC · 2 publications · 72 citations
2
h-index
TODS · 1 publications · 19 citations
1
h-index
1–3