Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
From MaRDI portal
Publication:799371
DOI10.1007/BF00264615zbMATH Open0548.68044DBLPjournals/acta/MehlhornV84WikidataQ56028156 ScholiaQ56028156MaRDI QIDQ799371FDOQ799371
Authors: K. Mehlhorn, Uzi Vishkin 
Publication date: 1984
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
- The complexity of deterministic PRAM simulation on distributed memory machines
- Efficient PRAM simulation on a distributed memory machine
- scientific article; zbMATH DE number 1998328
- Parallel random access machines with bounded memory wordsize
- Improved memory utilization in deterministic PRAM simulation
- Simulation of Parallel Random Access Machines by Circuits
- Processor-time tradeoffs in PRAM simulations
- Publication:4727434
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Fast probabilistic RAM simulation of single tape turing machine computations
Cited In (28)
- A new scheme for the deterministic simulation of PRAMs in VLSI
- Quantum key distribution using universal hash functions over finite fields
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
- Universal Hashing via Integer Arithmetic Without Primes, Revisited
- Parallel machine models: how they are and where are they going
- Optimal parallel randomized algorithms for sparse addition and identification
- Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Algorithms for the parallel alternating direction access machine
- Towards a scalable and robust DHT
- A complexity theory of efficient parallel algorithms
- How to emulate shared memory
- Polynomial hash functions are reliable (extended abstract)
- Improved deterministic PRAM simulation on the mesh
- Analysis of parallel uniform hashing
- Deterministic P-RAM simulation with constant redundancy
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- Efficient PRAM simulation on a distributed memory machine
- A probabilistic simulation of PRAMs on a bounded degree network
- Trade-offs between communication throughput and parallel time
- Representing shared data on distributed-memory parallel computers
- Permutations on the block PRAM
- Linear Hashing Is Awesome
- Locality-preserving hash functions for general purpose parallel computation
- Fast rehashing in PRAM emulations
- Practical constructive schemes for deterministic shared-memory access
- The complexity of deterministic PRAM simulation on distributed memory machines
This page was built for publication: Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799371)
