Practical constructive schemes for deterministic shared-memory access
From MaRDI portal
Publication:675852
DOI10.1007/BF02679451zbMATH Open0870.68025OpenAlexW2031876823MaRDI QIDQ675852FDOQ675852
Authors: F. P. Preparata, Andrea Pietracaprina 
Publication date: 7 September 1997
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02679451
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)
Cites Work
- Title not available (Why is that?)
- Algebraic coding theory
- Title not available (Why is that?)
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- How to emulate shared memory
- How to share memory in a distributed system
- Natural bounded concentrators
- Improved memory utilization in deterministic PRAM simulation
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
- A new scheme for the deterministic simulation of PRAMs in VLSI
Cited In (6)
- Deterministic concurrency: a clock-synchronised shared memory approach
- Constructive, Deterministic Implementation of Shared Memory on Meshes
- Shared-memory mutual exclusion: major research trends since 1986
- Representing shared data on distributed-memory parallel computers
- Bounds on shared memory for mutual exclusion
- Remote memory references at block granularity
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)
