Divide-and-conquer programming on MIMD computers

@article{Kumaran1995DivideandconquerPO,
  title={Divide-and-conquer programming on MIMD computers},
  author={Santhosh Kumaran and Michael J. Quinn},
  journal={Proceedings of 9th International Parallel Processing Symposium},
  year={1995},
  pages={734-741}
}
We have developed a programming template to implement divide and conquer algorithms on MIMD computers. The template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the programmability and performance of this approach by solving some well known numerical problems on a shared memory multiprocessor and a multicomputer. A byproduct of this work is a new parallel algorithm for solving tridiagonal systems of equations.<<ETX>> 

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

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

A high-level, object-oriented approach to divider-and-conquer

  • [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing
  • 1992

Parallel Programming in DIVACON ?’’ Tech

Z. G. Mou, P. Hudak
  • Report YALEXJ/DCS/TIt675, Yale IJnikersity, Dept of C‘nmputPr Science
  • 1990

Wid, Fortran 9U Explazned

I M . Mctcalf
  • Oxford Science Publirations,
  • 1990

Divide-andConquer Algorithms for Multiprocessors

L. Mukkavilli, G. M . Prabhu
  • Proceedings of the Fourth Conference on Hypercubes, Concurrent Computers, and Applications,
  • 1989

Applications of a strategy for de signing divide-and-conquer algorithms,

D. R. Smith
  • Scienice of Computer Program.ming,
  • 1987