Divide-and-conquer programming on MIMD computers
- 1 January 1995
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 9, 734-741
- https://doi.org/10.1109/ipps.1995.395867
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- A high-level, object-oriented approach to divider-and-conquerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Data-Parallel Programming on MIMD ComputersPublished by MIT Press ,1991
- Divide and conquer: A new parallel algorithm for the solution of a tridiagonal linear system of equationsPublished by Springer Nature ,1990
- An algebraic model for divide-and-conquer and its parallelismThe Journal of Supercomputing, 1988
- Applications of a strategy for designing divide-and-conquer algorithmsScience of Computer Programming, 1987
- Concurrent Prolog: A Progress ReportComputer, 1986
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Petri NetsACM Computing Surveys, 1977