A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
From MaRDI portal
Publication:5696959
DOI10.1142/S0129054103002230zbMath1075.68550OpenAlexW2089887438MaRDI QIDQ5696959
Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
Publication date: 19 October 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054103002230
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- How to emulate shared memory
- A new scheme for the deterministic simulation of PRAMs in VLSI
- Implementing shared memory on mesh-connected computers and on the fat-tree
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- How to share memory in a distributed system
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- An Optical Simulation of Shared Memory
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- Randomized Routing and Sorting on Fixed-Connection Networks
- Constructive, Deterministic Implementation of Shared Memory on Meshes
- Representing shared data on distributed-memory parallel computers
- Contention Resolution in Hashing Based Shared Memory Simulations
This page was built for publication: A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES