DocumentCode
2633159
Title
Divide-and-conquer programming on MIMD computers
Author
Kumaran, Santhosh ; Quinn, Michael J.
Author_Institution
Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA
fYear
1995
fDate
25-28 April 1995
Firstpage
734
Lastpage
741
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
divide and conquer methods; parallel algorithms; parallel machines; parallel programming; problem solving; MIMD computers; divide and conquer algorithms; divide-and-conquer programming; multicomputer; parallel algorithm; parallel divide and conquer function; performance; programmability; programming template; shared memory multiprocessor; tridiagonal systems of equations; Chaos; Computer languages; Computer science; Functional programming; Logic design; Logic programming; Parallel processing; Parallel programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1995. Proceedings., 9th International
Conference_Location
Santa Barbara, CA, USA
Print_ISBN
0-8186-7074-6
Type
conf
DOI
10.1109/IPPS.1995.395867
Filename
395867
Link To Document