Practical constructive schemes for deterministic shared-memory access
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3543634 (Why is no real title available?)
- scientific article; zbMATH DE number 512820 (Why is no real title available?)
- scientific article; zbMATH DE number 3893212 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- A new scheme for the deterministic simulation of PRAMs in VLSI
- Algebraic coding theory
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- How to emulate shared memory
- How to share memory in a distributed system
- Improved memory utilization in deterministic PRAM simulation
- Natural bounded concentrators
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
Cited in
(6)- Representing shared data on distributed-memory parallel computers
- Remote memory references at block granularity
- Constructive, Deterministic Implementation of Shared Memory on Meshes
- Deterministic concurrency: a clock-synchronised shared memory approach
- Shared-memory mutual exclusion: major research trends since 1986
- Bounds on shared memory for mutual exclusion
This page was built for publication: Practical constructive schemes for deterministic shared-memory access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675852)