Parallel random access machines with bounded memory wordsize
From MaRDI portal
Publication:757038
Recommendations
- PRAMs with variable word-size
- Memory access in models of parallel computation: From folklore to synergy and beyond
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Trade-Offs between Depth and Width in Parallel Computation
- Parallelism in random access machines
Cites work
Cited in
(12)- The bulk-synchronous parallel random access machine
- PRAMs with variable word-size
- Feasible real random access machines
- Limits on the power of parallel random access machines with weak forms of write conflict resolution
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits
- Simulation of Parallel Random Access Machines by Circuits
- scientific article; zbMATH DE number 4092776 (Why is no real title available?)
- Memory access in models of parallel computation: From folklore to synergy and beyond
- scientific article; zbMATH DE number 512845 (Why is no real title available?)
- Parallelism in random access machines
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Large parallel machines can be extremely slow for small problems
This page was built for publication: Parallel random access machines with bounded memory wordsize
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757038)