Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

@article{Mehlhorn1984RandomizedAD,
  title={Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories},
  author={Kurt Mehlhorn and Uzi Vishkin},
  journal={Acta Informatica},
  year={1984},
  volume={21},
  pages={339-374}
}
The present paper provides a comprehensive study of the following problem. Consider algorithms which are designed for shared memory models of parallel computation (PRAMs) in which processors are allowed to have fairly unrestricted access patterns to the shared memory. Consider also parallel machines in which the shared memory is organized in modules where only one cell of each module can be accessed at a time. Problem. Give general fast simulations of these algorithms by these parallel machines… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS