A new scheme for the deterministic simulation of PRAMs in VLSI

DOI10.1007/BF01840402zbMath0697.68058OpenAlexW1977542038MaRDI QIDQ911777

Andrea Pietracaprina, Fabrizio Luccio, Geppino Pucci

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840402

zbMATH Keywords

parallel computationpipeliningmodel of computation(n,m)-PRAMmesh-of-treessimulation between models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items (7)

Representing shared data on distributed-memory parallel computers ⋮ A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES ⋮ Practical constructive schemes for deterministic shared-memory access ⋮ Improved deterministic PRAM simulation on the mesh ⋮ The complexity of deterministic PRAM simulation on distributed memory machines ⋮ Towards a scalable and robust DHT ⋮ Deterministic P-RAM simulation with constant redundancy

Cites Work

• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• Sorting in \(c \log n\) parallel steps
• A probabilistic simulation of PRAMs on a bounded degree network
• How to share memory in a distributed system
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Ultracomputers
• Parallelism in random access machines

This page was built for publication: A new scheme for the deterministic simulation of PRAMs in VLSI