Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:assumes |
shared memory
synchronous computation unbounded number of processors unit time computation unit time memory access |
| gptkbp:describes |
theoretical parallel computer
|
| gptkbp:fullName |
Parallel Random Access Machine model
|
| gptkbp:hasApplication |
gptkb:complexity_theory
parallel algorithm design |
| gptkbp:hasComponent |
processors
shared memory cells |
| gptkbp:hasVariant |
CRCW PRAM
CREW PRAM EREW PRAM |
| https://www.w3.org/2000/01/rdf-schema#label |
PRAM model
|
| gptkbp:ignores |
communication cost
memory contention |
| gptkbp:introducedIn |
1970s
|
| gptkbp:limitation |
not realistic for practical machines
|
| gptkbp:relatedTo |
BSP model
RAM model |
| gptkbp:studiedIn |
theoretical computer science
|
| gptkbp:usedFor |
algorithm analysis
|
| gptkbp:usedIn |
parallel computing
|
| gptkbp:usedToAnalyze |
parallel algorithms
|
| gptkbp:bfsParent |
gptkb:Uzi_Vishkin
|
| gptkbp:bfsLayer |
7
|