How to emulate shared memory
From MaRDI portal
Publication:808683
DOI10.1016/0022-0000(91)90005-PzbMATH Open0732.68024OpenAlexW1969008575MaRDI QIDQ808683FDOQ808683
Authors: Abhiram Ranade 
Publication date: 1991
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(91)90005-p
Recommendations
Cites Work
- Universal classes of hash functions
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Routing, merging, and sorting on parallel models of computation
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
- How to emulate shared memory
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- Title not available (Why is that?)
- Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
Cited In (32)
- Optimal cover time for a graph-based coupon collector process
- Communication in parallel systems
- Fast algorithms for bit-serial routing on a hypercube
- Clocked adversaries for hashing
- Deadlock prevention by acyclic orientations
- Efficient parallel algorithms can be made robust
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
- Simulating the CRCW PRAM on reconfigurable networks
- Simulation of PRAMs with scan primitives by unbounded fan-in circuits
- Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
- On the performance and cost of some PRAM models on CMP hardware
- How to emulate shared memory
- Polynomial hash functions are reliable (extended abstract)
- Shared memory simulations with triple-logarithmic delay
- Improved deterministic PRAM simulation on the mesh
- Deterministic P-RAM simulation with constant redundancy
- Routing multiple paths in hypercubes
- Efficient PRAM simulation on a distributed memory machine
- Oblivious routing with limited buffer capacity
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system
- A note on implementing combining networks
- Towards a better understanding of pure packet routing
- Store-and-forward multicast routing on the mesh
- Representing shared data on distributed-memory parallel computers
- Locality-preserving hash functions for general purpose parallel computation
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- Efficient delay routing
- Parallel Weighted Random Sampling
- Data independence of read, write, and control structures in PRAM computations
- On the theory of interconnection networks for parallel computers
- Fast rehashing in PRAM emulations
- Practical constructive schemes for deterministic shared-memory access
This page was built for publication: How to emulate shared memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808683)
