Efficient PRAM simulation on a distributed memory machine
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432828 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 17533 (Why is no real title available?)
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- scientific article; zbMATH DE number 1142307 (Why is no real title available?)
- A complexity theory of efficient parallel algorithms
- Efficient Schemes for Parallel Communication
- How to emulate shared memory
- Parallel hashing
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Relations between Concurrent-Write Models of Parallel Computation
- Simulations among concurrent-write PRAMs
- The probabilistic method
- Universal classes of hash functions
Cited in
(39)- How to share memory in a distributed system
- On the drift of short schedules.
- scientific article; zbMATH DE number 7561283 (Why is no real title available?)
- Self-stabilizing repeated balls-into-bins
- Two-way chaining for non-uniform distributions
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
- Balls into bins via local search: cover time and maximum load
- An asymptotically optimal algorithm for generating bin cardinalities
- Balanced routing of random calls
- The log-star revolution
- Tight bounds for parallel randomized load balancing
- scientific article; zbMATH DE number 522833 (Why is no real title available?)
- Asynchronous PRAMs with memory latency
- Contention Resolution in Hashing Based Shared Memory Simulations
- Balls into bins with related random choices
- Balanced allocation and dictionaries with tightly packed constant size bins
- An improved drift theorem for balanced allocations
- Exploiting storage redundancy to speed up randomized shared memory simulations
- Balanced allocations with the choice of noise
- scientific article; zbMATH DE number 2102780 (Why is no real title available?)
- Exploiting storage redundancy to speed up randomized shared memory simulations
- The Power of Filling in Balanced Allocations
- Deterministic P-RAM simulation with constant redundancy
- Parallel load balancing on constrained client-server topologies
- Shared memory simulations with triple-logarithmic delay
- Load balancing under \(d\)-thinning
- Pseudosimulation: an algorithm for distributed simulation with limited memory
- Randomized allocation processes
- Locality-preserving hash functions for general purpose parallel computation
- Orientability Thresholds for Random Hypergraphs
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- Fast and optimal simulations between CRCW PRAMs
- scientific article; zbMATH DE number 1543296 (Why is no real title available?)
- Fault-tolerant shared memory simulations
- Thinning protocols for routing \(h\)-relations over shared media
- Practical load balancing for content requests in peer-to-peer networks
- Fast rehashing in PRAM emulations
This page was built for publication: Efficient PRAM simulation on a distributed memory machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923863)
