Wait-free Synchronization

Wait-Free Synchronization is a synchronization primitive that guarantees every thread will complete its operation in a finite number of steps regardless of the execution speed or behavior of other threads.

37

Publications

4.4K

Citations

67

Authors

44

Institutions

Publications per year

2017–2026

2

Authors

67

  1. MH
    Maurice Herlihy

    Brown University, United States

    5 publications · 2.3K citations

    5

    h-index

  2. MM
    Mark Moir

    Oracle (United States), United States

    4 publications · 175 citations

    4

    h-index

  3. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    4 publications · 188 citations

    4

    h-index

  4. FE
    Faith Ellen

    University of Toronto, Canada

    3 publications · 65 citations

    3

    h-index

  5. HC
    Hyeonjoong Cho

    Virginia Tech, United States

    3 publications · 42 citations

    3

    h-index

1–5 of 67

Venues

  1. Distributed Computing

    4 publications · 95 citations

    4

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 149 citations

    2

    h-index

  3. IEEE Transactions on Dependable and Secure Computing

    TDSC · 1 publications · 21 citations

    1

    h-index

  4. Science of Computer Programming

    1 publications · 117 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 70 citations

    1

    h-index

1–5