Compare-and-swap

Compare-And-Swap is a synchronization primitive that atomically compares the value stored at a memory location with an expected value and, if they match, updates the memory location with a new value, thereby enabling thread-safe manipulation of shared data in concurrent systems.

60

Publications

3.3K

Citations

111

Authors

48

Institutions

Publications per year

2017–2026

12

Authors

111

  1. NS
    Nir Shavit

    Tel Aviv University, Israel

    6 publications · 413 citations

    6

    h-index

  2. JJ
    Justin J. Levandoski

    University of Minnesota, United States

    5 publications · 288 citations

    5

    h-index

  3. DH
    Danny Hendler

    Ben-Gurion University of the Negev, Israel

    4 publications · 104 citations

    4

    h-index

  4. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    4 publications · 275 citations

    4

    h-index

  5. ER
    Eric Ruppert

    York University, Canada

    4 publications · 298 citations

    4

    h-index

1–5 of 111

Venues

  1. ACM SIGPLAN Notices

    3 publications · 72 citations

    3

    h-index

  2. 1

    h-index

  3. ACM Transactions on Computer Systems

    TOCS · 1 publications · 260 citations

    1

    h-index

  4. ArXiv.org

    Repository · 1 publications · 11 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 11 citations

    1

    h-index

1–5