Divide-and-conquer programming on MIMD computers

Authors:
Santhosh Kumaran;Michael J. Quinn
Affiliations:
-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 3

Architecture-adaptable finite element modelling: a case study using ocean circulation simulation

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Automatic exploitation of dual level parallelism on a network of multiprocessors

HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Modeling and simulation of parallel adaptive divide-and-conquer algorithms

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.