The complexity of deterministic PRAM simulation on distributed memory machines

DOI10.1007/BF02679461zbMath0870.68029OpenAlexW2041520855MaRDI QIDQ679435

Geppino Pucci, 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/bf02679461

zbMATH Keywords

parallel random access machinedistributed memory machine

Mathematics Subject Classification ID

Related Items (6)

The deterministic complexity of parallel multisearch ⋮ A probabilistic simulation of PRAMs on a bounded degree network ⋮ Store-and-forward multicast routing on the mesh ⋮ Improved deterministic PRAM simulation on the mesh ⋮ Unnamed Item ⋮ Implementing shared memory on mesh-connected computers and on the fat-tree

Cites Work

• Unnamed Item
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• A new scheme for the deterministic simulation of PRAMs in VLSI
• Tight Bounds on the Complexity of Parallel Sorting
• How to share memory in a distributed system
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Parallel hashing
• The Token Distribution Problem
• Optimal Sorting Algorithms for Parallel Computers
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• Representing shared data on distributed-memory parallel computers

This page was built for publication: The complexity of deterministic PRAM simulation on distributed memory machines