How to emulate shared memory

DOI10.1016/0022-0000(91)90005-PMaRDI QIDQ808683zbMATHOpenAlexFDO

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

zbMATH Keywords

routingshared memoryCRCW-PRAMN-node butterfly

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computer system organization (68M99)

Recommendations

• Efficient PRAM simulation on a distributed memory machine
• An Optical Simulation of Shared Memory
• Shared memory simulations with triple-logarithmic delay
• Implementing shared memory on mesh-connected computers and on the fat-tree
• How to share memory in a distributed system

Cites work

• scientific article; zbMATH DE number 4001488 (Why is no real title available?)
• Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
• How to emulate shared memory
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Routing, merging, and sorting on parallel models of computation
• Universal classes of hash functions

Cited in

(32)

• Clocked adversaries for hashing
• Representing shared data on distributed-memory parallel computers
• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
• Optimal cover time for a graph-based coupon collector process
• Routing multiple paths in hypercubes
• Efficient PRAM simulation on a distributed memory machine
• Shared memory simulations with triple-logarithmic delay
• Deadlock prevention by acyclic orientations
• Efficient parallel algorithms can be made robust
• Polynomial hash functions are reliable (extended abstract)
• Improved deterministic PRAM simulation on the mesh
• A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
• Simulating shared memory in real time: On the computation power of reconfigurable architectures
• A data parallel finite element method for computational fluid dynamics on the Connection Machine system
• Deterministic P-RAM simulation with constant redundancy
• On the performance and cost of some PRAM models on CMP hardware
• Fast rehashing in PRAM emulations
• Practical constructive schemes for deterministic shared-memory access
• Data independence of read, write, and control structures in PRAM computations
• Efficient delay routing
• Towards a better understanding of pure packet routing
• How to emulate shared memory
• Oblivious routing with limited buffer capacity
• On the theory of interconnection networks for parallel computers
• A note on implementing combining networks
• Fast algorithms for bit-serial routing on a hypercube
• Parallel Weighted Random Sampling
• Simulation of PRAMs with scan primitives by unbounded fan-in circuits
• Locality-preserving hash functions for general purpose parallel computation
• Communication in parallel systems
• Simulating the CRCW PRAM on reconfigurable networks
• Store-and-forward multicast routing on the mesh

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)