Deterministic P-RAM simulation with constant redundancy

DOI10.1016/0890-5401(91)90021-SzbMATH Open0722.68053OpenAlexW2033876407MaRDI QIDQ756419FDOQ756419

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• How to share memory in a distributed system

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)