Deterministic P-RAM simulation with constant redundancy

DOI10.1016/0890-5401(91)90021-SMaRDI QIDQ756419zbMATH OpenOpenAlexFDO

Authors Scot W. Hornick, F. P. Preparata

Publication date 1991

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(91)90021-s

zbMATH Keywords

bounded-degree networkdistributed-memorymemory granularityP-RAM simulationtwo-dimensional mesh of trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of deterministic PRAM simulation on distributed memory machines
• Publication:4727434
• Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
• Efficient PRAM simulation on a distributed memory machine
• A new scheme for the deterministic simulation of PRAMs in VLSI

Cites work

• A new scheme for the deterministic simulation of PRAMs in VLSI
• A probabilistic simulation of PRAMs on a bounded degree network
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Fast parallel sorting algorithms
• How to emulate shared memory
• How to share memory in a distributed system
• New lower bound techniques for VLSI
• Parallelism in random access machines
• Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

Cited in

(2)

• How to share memory in a distributed system
• scientific article; zbMATH DE number 3874614 (Why is no real title available?)

This page was built for publication: Deterministic P-RAM simulation with constant redundancy

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