Parallel Random Access Machine

Parallel Random Access Machine is a theoretical computational model in parallel computation characterized by multiple processors accessing a shared memory simultaneously, distinguished from other parallel models by its assumption of unit-time memory access for all processors regardless of contention.

91

Publications

5.9K

Citations

140

Authors

78

Institutions

Publications per year

2017–2026

2

Variants

Parallel Random Access Machine ModelsPram Models

Authors

140

  1. VR
    Vijaya Ramachandran

    The University of Texas at Austin, United States

    5 publications · 207 citations

    5

    h-index

  2. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    5 publications · 537 citations

    5

    h-index

  3. SG
    Selim G. Akl

    Queen's University, Canada

    4 publications · 68 citations

    4

    h-index

  4. QF
    Quentin F. Stout

    University of Michigan, United States

    4 publications · 226 citations

    4

    h-index

  5. JH
    John H. Reif

    Duke University, United States

    4 publications · 357 citations

    4

    h-index

1–5 of 140

Venues

  1. SIAM Journal on Computing

    15 publications · 1.4K citations

    12

    h-index

  2. IEEE Transactions on Computers

    6 publications · 275 citations

    6

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 85 citations

    4

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 142 citations

    3

    h-index

  5. ACM Transactions on Computational Logic

    TOCL · 2 publications · 221 citations

    2

    h-index

1–5