The complexity of deterministic PRAM simulation on distributed memory machines
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 512820 (Why is no real title available?)
- A new scheme for the deterministic simulation of PRAMs in VLSI
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- How to share memory in a distributed system
- Optimal Sorting Algorithms for Parallel Computers
- Parallel hashing
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Representing shared data on distributed-memory parallel computers
- The Token Distribution Problem
- Tight Bounds on the Complexity of Parallel Sorting
Cited in
(12)- A new scheme for the deterministic simulation of PRAMs in VLSI
- Pseudosimulation: an algorithm for distributed simulation with limited memory
- Improved deterministic PRAM simulation on the mesh
- Deterministic P-RAM simulation with constant redundancy
- ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE
- scientific article; zbMATH DE number 7561283 (Why is no real title available?)
- scientific article; zbMATH DE number 4001488 (Why is no real title available?)
- The deterministic complexity of parallel multisearch
- A probabilistic simulation of PRAMs on a bounded degree network
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Implementing shared memory on mesh-connected computers and on the fat-tree
- Store-and-forward multicast routing on the mesh
This page was built for publication: The complexity of deterministic PRAM simulation on distributed memory machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679435)
