On the parallel-decomposability of geometric problems

@article{Atallah1992OnTP,
  title={On the parallel-decomposability of geometric problems},
  author={Mikhail J. Atallah and Jyh-Jong Tsay},
  journal={Algorithmica},
  year={1992},
  volume={8},
  pages={209-231}
}
There is a large and growing body of literature concerning the solutions of geometric problems on mesh-connected arrays of processors. Most of these algorithms are optimal (i.e., run in timeO(n 1/d ) on ad-dimensionaln-processor array), and they all assume that the parallel machine is trying to solve a problem of sizen on ann-processor array. Here we investigate the situation where we have a mesh of sizep and we are interested in using it to solve a problem of sizen >p. The goal we seek is to… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
16 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…