Implementing shared memory on mesh-connected computers and on the fat-tree
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- A framework for solving VLSI graph layout problems
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- Deterministic on-line routing on area-universal networks
- How to share memory in a distributed system
- Improved deterministic PRAM simulation on the mesh
- Parallel hashing
- Representing shared data on distributed-memory parallel computers
- The complexity of deterministic PRAM simulation on distributed memory machines
Cited in
(10)- On the performance of networks with multiple busses
- Improved deterministic PRAM simulation on the mesh
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
- Constructive, Deterministic Implementation of Shared Memory on Meshes
- Constant-slowdown simulations of normal hypercube algorithms on the butterfly network
- Implementing shared memory on multi-dimensional meshes and on the fat-tree
- scientific article; zbMATH DE number 2090629 (Why is no real title available?)
- A probabilistic simulation of PRAMs on a bounded degree network
- scientific article; zbMATH DE number 1542824 (Why is no real title available?)
- Store-and-forward multicast routing on the mesh
This page was built for publication: Implementing shared memory on mesh-connected computers and on the fat-tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854415)