How to emulate shared memory
From MaRDI portal
Publication:808683
DOI10.1016/0022-0000(91)90005-PzbMath0732.68024OpenAlexW1969008575MaRDI QIDQ808683
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
Related Items
Locality-preserving hash functions for general purpose parallel computation, Simulation of PRAMs with scan primitives by unbounded fan-in circuits, A note on implementing combining networks, Towards a better understanding of pure packet routing, Simulating shared memory in real time: On the computation power of reconfigurable architectures, Efficient PRAM simulation on a distributed memory machine, Efficient delay routing, Parallel Weighted Random Sampling, Deadlock prevention by acyclic orientations, Shared memory simulations with triple-logarithmic delay, Routing with bounded buffers and hot-potato routing in vertex-symmetric networks, Representing shared data on distributed-memory parallel computers, Optimal cover time for a graph-based coupon collector process, Store-and-forward multicast routing on the mesh, Oblivious routing with limited buffer capacity, A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES, On the theory of interconnection networks for parallel computers, Data independence of read, write, and control structures in PRAM computations, Fast rehashing in PRAM emulations, Efficient parallel algorithms can be made robust, Practical constructive schemes for deterministic shared-memory access, Improved deterministic PRAM simulation on the mesh, ON THE PERFORMANCE AND COST OF SOME PRAM MODELS ON CMP HARDWARE, A data parallel finite element method for computational fluid dynamics on the Connection Machine system, Clocked adversaries for hashing, Fast algorithms for bit-serial routing on a hypercube, Routing multiple paths in hypercubes, Polynomial hash functions are reliable, Deterministic P-RAM simulation with constant redundancy, Simulating the CRCW PRAM on reconfigurable networks, How to emulate shared memory
Cites Work
- Unnamed Item
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- How to emulate shared memory
- Routing, merging, and sorting on parallel models of computation
- Universal classes of hash functions
- Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
