Wait-free Programming

Wait-Free Programming is a concurrency control paradigm in thread programming where each method or operation is guaranteed to complete within a finite number of steps, irrespective of the execution speed or behavior of other threads, thereby ensuring progress and liveness for all participating processes.

41

Publications

3.2K

Citations

79

Authors

48

Institutions

Publications per year

2017–2026

3

Authors

79

  1. JH
    James H. Anderson

    University of North Carolina at Chapel Hill, United States

    6 publications · 285 citations

    6

    h-index

  2. JM
    John Mellor‐Crummey

    Rice University, United States

    4 publications · 117 citations

    4

    h-index

  3. MM
    Mark Moir

    Oracle (United States), United States

    4 publications · 229 citations

    4

    h-index

  4. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    3 publications · 136 citations

    3

    h-index

  5. PJ
    Prasad Jayanti

    Dartmouth College, United States

    3 publications · 142 citations

    3

    h-index

1–5 of 79

Venues

  1. Distributed Computing

    5 publications · 106 citations

    5

    h-index

  2. Journal of the ACM

    JACM · 3 publications · 551 citations

    3

    h-index

  3. ACM SIGPLAN Notices

    2 publications · 42 citations

    2

    h-index

  4. Information Processing Letters

    2 publications · 27 citations

    2

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 2 publications · 81 citations

    2

    h-index

1–5