A parallelization of adaptive task partitioning algorithms (Q1106613): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-8191(88)90040-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060627502 / rank | |||
Normal rank |
Latest revision as of 00:52, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallelization of adaptive task partitioning algorithms |
scientific article |
Statements
A parallelization of adaptive task partitioning algorithms (English)
0 references
1988
0 references
The authors are concerned with an adaptive algorithm where each step involves either the completion or partitioning of a task. They first discuss the historical background and their model for macro-supported high-level parallelization and the performance modeling. They argue that for many serial adaptive procedures, their methodology provides a direct translation into reasonably efficient parallel versions. At the final section, they apply the algorithm to the evaluation of an improper double integral \(\int^{1}_{0}[\int^{1-x}_{0}(x^ 2+y^ 2)^{-0.5}dy]dx\) within a relative accuracy \(10^{-6}\), as a typical example. According to their implementation under Unix on the HEP machines at Argonne Labs, total execution time seems to be saturated when the numbers of processor are 8.
0 references
adaptive partitioning
0 references
two dimensional integration
0 references
parallelization
0 references
improper double integral
0 references