Divide-and-conquer and parallel graph reduction (Q1175201): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:32, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Divide-and-conquer and parallel graph reduction |
scientific article |
Statements
Divide-and-conquer and parallel graph reduction (English)
0 references
25 June 1992
0 references
A transputer based parallel graph reduction system is described for the execution of functional programs following the divide-and-conquer- paradigm. The main idea is called dynamic partitioning, which refers to the maximum level of recursion up to which the system tries to solve subtasks in parallel and after which execution continues sequentially. Several experimental results on a mesh of 16 transputers are presented and discussed taking into account execution times, load balancing and task distribution. Based on the results obtained suggestions are made w.r.t. the partitioning depending on some characteristic properties of the programs.
0 references
parallel graph reduction
0 references
functional programs
0 references
divide-and-conquer
0 references
partitioning
0 references