Simulation of PRAM Models on Meshes

@inproceedings{Leppnen1994SimulationOP,
  title={Simulation of PRAM Models on Meshes},
  author={Ville Lepp{\"a}nen and Martti Penttonen},
  booktitle={PARLE},
  year={1994}
}
We analyze the complexity of simulating a PRAM (parallel random access machine) on a mesh structured distributed memory machine. By utilizing suitable algorithms for randomized hashing, routing in a mesh, and sorting in a mesh, we prove that simulation of a PRAM on p N p N (or 3 p N 3 p N 3 p N) mesh is possible with O(p N) (respectively O(3 p N)) delay with high probability and a relatively small constant. Furthermore, with more sophisticated simulations further speed-ups are achieved… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 69 REFERENCES

Klugerman. Theory of Parallel and VLSI Com- putation, Lecture notes for 18.435/6.848

  • T. Leighton, C. E. Leiserson
  • Technical Report MIT/LCS/RSS 10,
  • 1991
Highly Influential
19 Excerpts

PRAM Computation on Mesh Structures

  • V. Leppanen
  • Technical Report R-93-9,
  • 1993
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…