Work

Parallel Algorithms for Solving Triangular Linear Systems with Small Parallelism,

Year: 1974
Type: report
Abstract: The problem of solving triangular linear systems of size $n$ on a parallel computer with small parallelism is considered. Assuming that the time is measured by the number of parallel steps of any arithmetic operation. It is shown that the problem can be done in time\[\frac{n^2}{k} + O(n) \ \text{with} \ k \ \text{processors for} \ k \leq O(n),\]\[O(n^{2-r} \log^r n) \ \text{with} \ O(n^r) \ \text{processors for} \ 1 < r < \frac{3}{2}, \ \text{and}\]\[O(n^{1-\frac{r}{2}} \log^r n) \ \text{with} \ O(n^r) \ \text{processors for} \ \frac{3}{2} < r < 3.\]The results are obtained by using two principles of reducing parallel algorithms with large parallelism to parallel algorithms with small parallelism. The two principles for the reduction are expected to be useful for other problems.
Source: HAL
Language: English
Open Access status: green
OpenAlex ID: W223854058
Cites:
Cited by: 11
Related to: 10