Practical constructive schemes for deterministic shared-memory access

DOI10.1007/BF02679451zbMath0870.68025OpenAlexW2031876823MaRDI QIDQ675852

Franco 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

zbMATH Keywords

granularity problemmemory modules

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• How to emulate shared memory
• A new scheme for the deterministic simulation of PRAMs in VLSI
• Improved memory utilization in deterministic PRAM simulation
• Natural bounded concentrators
• How to share memory in a distributed system
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks

This page was built for publication: Practical constructive schemes for deterministic shared-memory access