论文信息 - Parallel Algorithms for Solving Linear Recurrence Systems

Parallel Algorithms for Solving Linear Recurrence Systems

We present two parallel algorithms for solving linear recurrence systems R 〈n,m〉 where m is relatively small, which can be simply implemented on message passing multiprocessors. Theorems concerning their time complexity are also given together with the criterion when each of them should be used. If m is O(1) then the algorithms are effective.

Przemyslaw Stpiczynski

[1] David J. Kuck,et al. Time and Parallel Processor Bounds for Linear Recurrence Systems , 1975, IEEE Transactions on Computers.

[2] Jagdish J. Modi,et al. Parallel algorithms and matrix computation , 1988 .

[3] D. Heller. A Survey of Parallel Algorithms in Numerical Linear Algebra. , 1978 .

[4] Shyh-Ching Chen. Speedup of iterative programs in multiprocessing systems. , 1975 .

[5] R. Brent,et al. Solving Triangular Systems on a Parallel Computer , 1977 .

[6] Yves Robert,et al. Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors , 1989, Inf. Process. Lett..

[7] Michel Cosnard,et al. Gaussian Elimination on Message Passing Architecture , 1987, ICS.

[8] H. T. Kung,et al. The Complexity of Parallel Evaluation of Linear Recurrences , 1977, JACM.

[9] David L. Kuck,et al. The Structure of Computers and Computations , 1978 .