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

Authors

42

  1. ML
    Michael L. Scott

    University of Rochester, United States

    5 publications · 203 citations

    5

    h-index

  2. NS
    Nir Shavit

    Tel Aviv University, Israel

    4 publications · 252 citations

    4

    h-index

  3. VJ
    Virendra J. Marathe

    University of Rochester, United States

    4 publications · 252 citations

    4

    h-index

  4. WN
    William N. Scherer

    University of Rochester, United States

    3 publications · 117 citations

    3

    h-index

  5. DD
    David Dice

    Oracle (United States), United States

    3 publications · 181 citations

    3

    h-index

1–5 of 42

Venues

  1. ACM SIGPLAN Notices

    2 publications · 35 citations

    2

    h-index

  2. ACM Transactions on Parallel Computing

    TOPC · 2 publications · 72 citations

    2

    h-index

  3. ACM Transactions on Database Systems

    TODS · 1 publications · 19 citations

    1

    h-index

1–3