The complexity of deterministic PRAM simulation on distributed memory machines

DOI10.1007/BF02679461zbMATH Open0870.68029OpenAlexW2041520855MaRDI QIDQ679435FDOQ679435

Authors: 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

Recommendations

• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• Deterministic P-RAM simulation with constant redundancy
• Publication:4727434
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones

zbMATH Keywords

parallel random access machinedistributed memory machine

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computer system organization (68M99)

Cites Work

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

Cited In (12)

• Title not available (Why is that?)
• The deterministic complexity of parallel multisearch
• A new scheme for the deterministic simulation of PRAMs in VLSI
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
• ANALYSIS OF PRAM INSTRUCTION SETS FROM A LOG COST PERSPECTIVE
• Improved deterministic PRAM simulation on the mesh
• Deterministic P-RAM simulation with constant redundancy
• A probabilistic simulation of PRAMs on a bounded degree network
• Title not available (Why is that?)
• Pseudosimulation: an algorithm for distributed simulation with limited memory
• Store-and-forward multicast routing on the mesh
• Implementing shared memory on mesh-connected computers and on the fat-tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679435)