PARALLEL ALGORITHMS FOR SOLVING TRIANGULAR LINEAR SYSTEMS WITH SMALL PARALLELISM

摘要

The problem of solving triangular linear systems of size n on a parallel computer with small parallelism is considered. Assume that the time is measured by the number of parallel steps of any arithmetic operation.nThe results are obtained by using two principles of reducing parallel algor¬ithms with large parallelism to parallel algorithms with small parallelism. The two principles for the reduction are expected to be useful for other problems.