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
91
Parallelism in random access machines
Steven Fortune, James Wyllie · 1978 · 885 citations
A Survey of Parallel Algorithms for Shared-Memory Machines
Richard M. Karp · UC Berkeley · 1988 · 322 citations
The design and analysis of parallel algorithms
C. Rodrı́guez · 2005 · 291 citations
The Complexity of Parallel Computations
James Wyllie · eCommons (Cornell University) · 1979 · 201 citations · Full text
1–5 of 91
140
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 140
78
University of Michigan
Ann Arbor, United States
7 h-index
7 publications
488 citations
The University of Texas at Austin
Austin, United States
5 h-index
8 publications
215 citations
Queen's University
Kingston, Canada
4 h-index
8 publications
136 citations
University at Buffalo, State University of New York
Buffalo, United States
3 h-index
3 publications
182 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
5 publications
198 citations
Princeton University
Princeton, United States
3 h-index
5 publications
228 citations
Louisiana State University
Baton Rouge, United States
3 h-index
4 publications
54 citations

Cornell University
Ithaca, United States
3 h-index
4 publications
306 citations
1–8 of 78
15 publications · 1.4K citations
12
h-index
6 publications · 275 citations
6
h-index
TPDS · 4 publications · 85 citations
4
h-index
JACM · 3 publications · 142 citations
3
h-index
TOCL · 2 publications · 221 citations
2
h-index
1–5