A probabilistic simulation of PRAMs on a bounded degree network

DOI10.1016/0020-0190(88)90160-3zbMath0661.68049OpenAlexW1997142363MaRDI QIDQ1113672

Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90160-3

zbMATH Keywords

parallel processingVLSItheory of computationinterconnection networkTime complexityPRAM simulation

Mathematics Subject Classification ID

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

Related Items (3)

Representing shared data on distributed-memory parallel computers ⋮ A new scheme for the deterministic simulation of PRAMs in VLSI ⋮ Deterministic P-RAM simulation with constant redundancy

Cites Work

• The complexity of deterministic PRAM simulation on distributed memory machines
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• How to share memory in a distributed system
• Ultracomputers
• Parallelism in random access machines
• Unnamed Item

This page was built for publication: A probabilistic simulation of PRAMs on a bounded degree network