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

Authors

105

  1. MM
    Mark Moir

    Oracle (United States), United States

    8 publications · 831 citations

    8

    h-index

  2. NS
    Nir Shavit

    Tel Aviv University, Israel

    6 publications · 323 citations

    6

    h-index

  3. VL
    Victor Luchangco

    Oracle (United States), United States

    4 publications · 585 citations

    4

    h-index

  4. FK
    F. K. Hwang

    AT&T (United States), United States

    4 publications · 116 citations

    4

    h-index

  5. ML
    Michael L. Scott

    University of Rochester, United States

    4 publications · 1K citations

    4

    h-index

1–5 of 105

Venues

  1. Distributed Computing

    3 publications · 136 citations

    3

    h-index

  2. IEEE Transactions on Communications

    3 publications · 78 citations

    3

    h-index

  3. 3

    h-index

  4. IEEE Communications Magazine

    2 publications · 100 citations

    2

    h-index

  5. IEEE Transactions on Computers

    2 publications · 69 citations

    2

    h-index

1–5