Parallel RAM
In computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended as the parallel-computing analogy to the random-access machine (RAM) (not to be confused with random-access memory). In the same way that the RAM is used by sequential-algorithm designers to model algorithmic performance (such as time complexity), the PRAM is used by parallel-algorithm designers to model parallel algorithmic performance (such as time complexity, where the number of processors assumed is typically also stated). Similar to the way in which the RAM model neglects practical issues, such as access time to cache memory versus main memory, the PRAM model neglects such issues as synchronization and communication, but provides
- Comment
- enIn computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended as the parallel-computing analogy to the random-access machine (RAM) (not to be confused with random-access memory). In the same way that the RAM is used by sequential-algorithm designers to model algorithmic performance (such as time complexity), the PRAM is used by parallel-algorithm designers to model parallel algorithmic performance (such as time complexity, where the number of processors assumed is typically also stated). Similar to the way in which the RAM model neglects practical issues, such as access time to cache memory versus main memory, the PRAM model neglects such issues as synchronization and communication, but provides
- Has abstract
- enIn computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstract machine. As its name indicates, the PRAM is intended as the parallel-computing analogy to the random-access machine (RAM) (not to be confused with random-access memory). In the same way that the RAM is used by sequential-algorithm designers to model algorithmic performance (such as time complexity), the PRAM is used by parallel-algorithm designers to model parallel algorithmic performance (such as time complexity, where the number of processors assumed is typically also stated). Similar to the way in which the RAM model neglects practical issues, such as access time to cache memory versus main memory, the PRAM model neglects such issues as synchronization and communication, but provides any (problem-size-dependent) number of processors. Algorithm cost, for instance, is estimated using two parameters O(time) and O(time × processor_number).
- Is primary topic of
- Parallel RAM
- Label
- enParallel RAM
- Link from a Wikipage to an external page
- dl.acm.org/citation.cfm%3Fid=894803
- www.umiacs.umd.edu/users/vishkin/PUBLICATIONS/classnotes.pdf
- sourceforge.net/projects/xmtc/
- www-wjp.cs.uni-sb.de/forschung/projekte/SB-PRAM/index.php
- www.umiacs.umd.edu/users/vishkin/XMT/spaa07paper.pdf
- Link from a Wikipage to another Wikipage
- Abstract machine
- Analysis of PRAM algorithms
- Category:Analysis of parallel algorithms
- Category:Models of computation
- Central processing unit
- Communication
- Computer science
- Dynamic random-access memory
- Explicit multi-threading
- Field-programmable gate array
- Flynn's taxonomy
- Fortran language features
- Lock-free and wait-free algorithms
- Maximum flow problem
- Parallel external memory (Model)
- Parallel programming model
- Random-access machine
- Random-access memory
- Resource contention
- Shared memory architecture
- SIMD
- Static random-access memory
- Synchronization (computer science)
- SystemVerilog
- Turing Machine
- XMTC
- SameAs
- 4361282-9
- iH5M
- Máquina de acesso randômico paralelo
- Parallel random access machine
- Parallel Random Access Machine
- Parallel random access-machine
- PRAM模型
- Q1754095
- RAM paralel
- Паралельна машина з довільним доступом
- حافظه دسترسی تصادفی موازی
- 並列ランダムアクセス機械
- Subject
- Category:Analysis of parallel algorithms
- Category:Models of computation
- WasDerivedFrom
- Parallel RAM?oldid=1121166782&ns=0
- WikiPageLength
- 9921
- Wikipage page ID
- 956675
- Wikipage revision ID
- 1121166782
- WikiPageUsesTemplate
- Template:Authority control
- Template:Citation
- Template:Cite book
- Template:Harvtxt
- Template:More footnotes
- Template:Parallel Computing
- Template:Reflist
- Template:Short description