Shared-memory Algorithms

Shared-Memory Algorithms is a class of parallel algorithms designed to solve computational problems by enabling multiple processing units to access and manipulate a common memory space, distinguished by their reliance on shared variables and synchronization mechanisms to coordinate concurrent execution in contrast to message-passing or distributed-memory models.

508

Publications

31.3K

Citations

1.2K

Authors

396

Institutions

Publications per year

2017–2026

48

Authors

1.2K

  1. HA
    Hagit Attiya

    Technion – Israel Institute of Technology, Israel

    10 publications · 864 citations

    10

    h-index

  2. PB
    Phillip B. Gibbons

    Carnegie Mellon University, United States

    8 publications · 329 citations

    8

    h-index

  3. MS
    Marc Snir

    University of Illinois Urbana-Champaign, United States

    7 publications · 431 citations

    7

    h-index

  4. NL
    Nancy Lynch

    Massachusetts Institute of Technology, United States

    7 publications · 316 citations

    7

    h-index

  5. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    6 publications · 445 citations

    6

    h-index

1–5 of 1.2K

Venues

  1. Parallel Computing

    14 publications · 395 citations

    13

    h-index

  2. arXiv (Cornell University)

    Repository · 11 publications · 1.4K citations

    10

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 11 publications · 314 citations

    10

    h-index

  4. IEEE Transactions on Computers

    10 publications · 806 citations

    10

    h-index

  5. Journal of the ACM

    JACM · 9 publications · 1.1K citations

    9

    h-index

1–5